./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.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_fillercodesize_ps-cn-25_file-66.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 f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:27:46,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:27:46,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:27:46,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:27:46,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:27:46,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:27:46,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:27:46,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:27:46,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:27:46,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:27:46,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:27:46,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:27:46,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:27:46,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:27:46,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:27:46,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:27:46,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:27:46,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:27:46,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:27:46,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:27:46,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:27:46,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:27:46,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:27:46,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:27:46,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:27:46,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:27:46,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:27:46,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:27:46,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:27:46,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:27:46,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:27:46,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:27:46,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:27:46,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:27:46,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:27:46,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:27:46,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:27:46,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:27:46,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:27:46,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:27:46,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:27:46,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:27:46,932 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 -> f51329798d39553bfe6698070ebd1150c84493b84ecd2c17e90b69fb6b7c2e13 [2024-11-10 04:27:47,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:27:47,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:27:47,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:27:47,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:27:47,212 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:27:47,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2024-11-10 04:27:48,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:27:48,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:27:48,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2024-11-10 04:27:48,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2529b068d/49b99e6de0684e3788bdf0f8d7c37492/FLAG8b6288f7d [2024-11-10 04:27:49,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2529b068d/49b99e6de0684e3788bdf0f8d7c37492 [2024-11-10 04:27:49,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:27:49,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:27:49,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:27:49,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:27:49,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:27:49,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf32842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49, skipping insertion in model container [2024-11-10 04:27:49,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:27:49,221 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_fillercodesize_ps-cn-25_file-66.i[915,928] [2024-11-10 04:27:49,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:27:49,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:27:49,305 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_fillercodesize_ps-cn-25_file-66.i[915,928] [2024-11-10 04:27:49,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:27:49,388 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:27:49,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49 WrapperNode [2024-11-10 04:27:49,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:27:49,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:27:49,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:27:49,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:27:49,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,452 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 04:27:49,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:27:49,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:27:49,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:27:49,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:27:49,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,501 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 04:27:49,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:27:49,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:27:49,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:27:49,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:27:49,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (1/1) ... [2024-11-10 04:27:49,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:27:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:27:49,568 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 04:27:49,575 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 04:27:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:27:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:27:49,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:27:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:27:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:27:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:27:49,717 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:27:49,718 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:27:50,196 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 04:27:50,198 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:27:50,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:27:50,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:27:50,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:27:50 BoogieIcfgContainer [2024-11-10 04:27:50,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:27:50,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:27:50,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:27:50,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:27:50,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:27:49" (1/3) ... [2024-11-10 04:27:50,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fd797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:27:50, skipping insertion in model container [2024-11-10 04:27:50,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:27:49" (2/3) ... [2024-11-10 04:27:50,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fd797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:27:50, skipping insertion in model container [2024-11-10 04:27:50,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:27:50" (3/3) ... [2024-11-10 04:27:50,226 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-66.i [2024-11-10 04:27:50,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:27:50,242 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:27:50,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:27:50,315 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;@76b17f1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:27:50,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:27:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:27:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:27:50,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:50,345 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:50,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:50,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -608323649, now seen corresponding path program 1 times [2024-11-10 04:27:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709040629] [2024-11-10 04:27:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:51,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:51,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:27:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709040629] [2024-11-10 04:27:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709040629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:27:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766572955] [2024-11-10 04:27:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:51,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:27:51,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:51,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:27:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:27:51,092 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:27:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:51,182 INFO L93 Difference]: Finished difference Result 178 states and 313 transitions. [2024-11-10 04:27:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:27:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-11-10 04:27:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:51,198 INFO L225 Difference]: With dead ends: 178 [2024-11-10 04:27:51,198 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 04:27:51,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 04:27:51,204 INFO L432 NwaCegarLoop]: 136 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, 136 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 04:27:51,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:27:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 04:27:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 04:27:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:27:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-11-10 04:27:51,265 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 205 [2024-11-10 04:27:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:51,269 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-11-10 04:27:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:27:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-11-10 04:27:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:27:51,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:51,274 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:27:51,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1015244865, now seen corresponding path program 1 times [2024-11-10 04:27:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530333979] [2024-11-10 04:27:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:27:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:27:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:27:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:27:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:27:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:27:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:27:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:27:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:27:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:27:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:27:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:27:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:27:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:27:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:27:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:27:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:27:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:27:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:27:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:27:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:27:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:27:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:27:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:27:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:27:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:27:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:27:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:27:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:27:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:27:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:27:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:27:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:27:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:27:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:27:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:27:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530333979] [2024-11-10 04:27:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530333979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:27:58,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:27:58,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 04:27:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399077883] [2024-11-10 04:27:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:27:58,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 04:27:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:27:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 04:27:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:27:58,592 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:27:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:27:59,826 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2024-11-10 04:27:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 04:27:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:27:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:27:59,831 INFO L225 Difference]: With dead ends: 307 [2024-11-10 04:27:59,831 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 04:27:59,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 04:27:59,833 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 214 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:27:59,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1002 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 04:27:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 04:27:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2024-11-10 04:27:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:27:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2024-11-10 04:27:59,864 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 205 [2024-11-10 04:27:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:27:59,865 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2024-11-10 04:27:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:27:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2024-11-10 04:27:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:27:59,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:27:59,875 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:59,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:27:59,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:27:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:27:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -986615714, now seen corresponding path program 1 times [2024-11-10 04:27:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:27:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176258442] [2024-11-10 04:27:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:27:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:04,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176258442] [2024-11-10 04:28:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176258442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:04,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 04:28:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144013428] [2024-11-10 04:28:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 04:28:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 04:28:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:28:04,363 INFO L87 Difference]: Start difference. First operand 134 states and 203 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:07,297 INFO L93 Difference]: Finished difference Result 222 states and 305 transitions. [2024-11-10 04:28:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 04:28:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:07,302 INFO L225 Difference]: With dead ends: 222 [2024-11-10 04:28:07,302 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 04:28:07,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 04:28:07,307 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:07,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 881 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 04:28:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 04:28:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2024-11-10 04:28:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:28:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2024-11-10 04:28:07,342 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 205 [2024-11-10 04:28:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2024-11-10 04:28:07,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2024-11-10 04:28:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:07,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:07,350 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:28:07,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1211758370, now seen corresponding path program 1 times [2024-11-10 04:28:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922993011] [2024-11-10 04:28:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:11,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922993011] [2024-11-10 04:28:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922993011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 04:28:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611242789] [2024-11-10 04:28:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 04:28:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 04:28:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:28:11,667 INFO L87 Difference]: Start difference. First operand 134 states and 203 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:12,533 INFO L93 Difference]: Finished difference Result 230 states and 314 transitions. [2024-11-10 04:28:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 04:28:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:12,536 INFO L225 Difference]: With dead ends: 230 [2024-11-10 04:28:12,536 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 04:28:12,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 04:28:12,538 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 186 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:12,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 961 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:28:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 04:28:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 138. [2024-11-10 04:28:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 100 states have internal predecessors, (137), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:28:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 209 transitions. [2024-11-10 04:28:12,571 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 209 transitions. Word has length 205 [2024-11-10 04:28:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:12,572 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 209 transitions. [2024-11-10 04:28:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 209 transitions. [2024-11-10 04:28:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:12,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:12,575 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:12,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:28:12,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:12,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1183129219, now seen corresponding path program 1 times [2024-11-10 04:28:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020771993] [2024-11-10 04:28:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020771993] [2024-11-10 04:28:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020771993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:17,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 04:28:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202506016] [2024-11-10 04:28:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:17,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 04:28:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 04:28:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:28:17,337 INFO L87 Difference]: Start difference. First operand 138 states and 209 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:18,481 INFO L93 Difference]: Finished difference Result 227 states and 311 transitions. [2024-11-10 04:28:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 04:28:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:18,485 INFO L225 Difference]: With dead ends: 227 [2024-11-10 04:28:18,485 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 04:28:18,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 04:28:18,486 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 198 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:18,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1035 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:28:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 04:28:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 134. [2024-11-10 04:28:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:28:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2024-11-10 04:28:18,502 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 205 [2024-11-10 04:28:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:18,502 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2024-11-10 04:28:18,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2024-11-10 04:28:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:18,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:18,505 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:18,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:28:18,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:18,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1308647872, now seen corresponding path program 1 times [2024-11-10 04:28:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:18,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499700944] [2024-11-10 04:28:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:18,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499700944] [2024-11-10 04:28:18,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499700944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:18,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:18,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:28:18,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092138895] [2024-11-10 04:28:18,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:18,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:28:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:28:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:28:18,612 INFO L87 Difference]: Start difference. First operand 134 states and 203 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:18,663 INFO L93 Difference]: Finished difference Result 377 states and 575 transitions. [2024-11-10 04:28:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:28:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:18,668 INFO L225 Difference]: With dead ends: 377 [2024-11-10 04:28:18,668 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 04:28:18,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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 04:28:18,673 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:18,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 371 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:28:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 04:28:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-10 04:28:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 166 states have (on average 1.319277108433735) internal successors, (219), 168 states have internal predecessors, (219), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 04:28:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 363 transitions. [2024-11-10 04:28:18,716 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 363 transitions. Word has length 205 [2024-11-10 04:28:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 363 transitions. [2024-11-10 04:28:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2024-11-10 04:28:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:18,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:18,722 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:18,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:28:18,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:18,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1178864961, now seen corresponding path program 1 times [2024-11-10 04:28:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:18,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762586115] [2024-11-10 04:28:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:18,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762586115] [2024-11-10 04:28:18,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762586115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:18,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:28:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388462215] [2024-11-10 04:28:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:18,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:28:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:28:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:28:18,920 INFO L87 Difference]: Start difference. First operand 243 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:19,197 INFO L93 Difference]: Finished difference Result 721 states and 1066 transitions. [2024-11-10 04:28:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:28:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:19,203 INFO L225 Difference]: With dead ends: 721 [2024-11-10 04:28:19,203 INFO L226 Difference]: Without dead ends: 481 [2024-11-10 04:28:19,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:28:19,205 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 94 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:19,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 409 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:28:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-10 04:28:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 432. [2024-11-10 04:28:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 286 states have internal predecessors, (367), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 137 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 04:28:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 647 transitions. [2024-11-10 04:28:19,277 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 647 transitions. Word has length 205 [2024-11-10 04:28:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:19,278 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 647 transitions. [2024-11-10 04:28:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 647 transitions. [2024-11-10 04:28:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:19,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:19,281 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 04:28:19,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash 982351456, now seen corresponding path program 1 times [2024-11-10 04:28:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144629474] [2024-11-10 04:28:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144629474] [2024-11-10 04:28:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144629474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 04:28:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770595989] [2024-11-10 04:28:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 04:28:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 04:28:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:28:21,721 INFO L87 Difference]: Start difference. First operand 432 states and 647 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:22,738 INFO L93 Difference]: Finished difference Result 591 states and 827 transitions. [2024-11-10 04:28:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 04:28:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-10 04:28:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:22,744 INFO L225 Difference]: With dead ends: 591 [2024-11-10 04:28:22,745 INFO L226 Difference]: Without dead ends: 588 [2024-11-10 04:28:22,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:28:22,746 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 303 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:22,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 797 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 04:28:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-10 04:28:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 490. [2024-11-10 04:28:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 330 states have (on average 1.2787878787878788) internal successors, (422), 335 states have internal predecessors, (422), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-10 04:28:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 718 transitions. [2024-11-10 04:28:22,807 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 718 transitions. Word has length 205 [2024-11-10 04:28:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:22,808 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 718 transitions. [2024-11-10 04:28:22,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:28:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2024-11-10 04:28:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:22,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:22,811 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 04:28:22,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1010980607, now seen corresponding path program 1 times [2024-11-10 04:28:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401379220] [2024-11-10 04:28:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:28:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:28:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:28:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:28:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:28:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:28:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:28:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:28:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:28:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:28:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:28:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:28:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:28:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:28:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:28:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401379220] [2024-11-10 04:28:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401379220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 04:28:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852863445] [2024-11-10 04:28:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 04:28:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 04:28:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:28:53,150 INFO L87 Difference]: Start difference. First operand 490 states and 718 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-10 04:28:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:59,838 INFO L93 Difference]: Finished difference Result 577 states and 812 transitions. [2024-11-10 04:28:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 04:28:59,839 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 205 [2024-11-10 04:28:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:59,843 INFO L225 Difference]: With dead ends: 577 [2024-11-10 04:28:59,843 INFO L226 Difference]: Without dead ends: 574 [2024-11-10 04:28:59,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2024-11-10 04:28:59,845 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 435 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:59,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 990 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 04:28:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-10 04:28:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2024-11-10 04:28:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 330 states have (on average 1.2787878787878788) internal successors, (422), 335 states have internal predecessors, (422), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-10 04:28:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 718 transitions. [2024-11-10 04:28:59,932 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 718 transitions. Word has length 205 [2024-11-10 04:28:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:59,933 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 718 transitions. [2024-11-10 04:28:59,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-10 04:28:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2024-11-10 04:28:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 04:28:59,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:59,935 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:59,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 04:28:59,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1520803490, now seen corresponding path program 1 times [2024-11-10 04:28:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700765685] [2024-11-10 04:28:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:29:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:29:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:29:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:29:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:29:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:29:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:29:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:29:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:29:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:29:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:29:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:29:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:29:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:29:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:29:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:29:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:29:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:29:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:29:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 04:29:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:29:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 04:29:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 04:29:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 04:29:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 04:29:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 04:29:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 04:29:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 04:29:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 04:29:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 04:29:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 04:29:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 04:29:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:29:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:29:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700765685] [2024-11-10 04:29:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700765685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:29:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:29:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:29:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686944447] [2024-11-10 04:29:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:29:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:29:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:29:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:29:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:29:00,413 INFO L87 Difference]: Start difference. First operand 490 states and 718 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:29:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:29:00,686 INFO L93 Difference]: Finished difference Result 912 states and 1321 transitions. [2024-11-10 04:29:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:29:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-11-10 04:29:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:29:00,690 INFO L225 Difference]: With dead ends: 912 [2024-11-10 04:29:00,692 INFO L226 Difference]: Without dead ends: 498 [2024-11-10 04:29:00,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:29:00,694 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 150 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:29:00,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 262 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:29:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-10 04:29:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2024-11-10 04:29:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 322 states have (on average 1.2453416149068324) internal successors, (401), 327 states have internal predecessors, (401), 152 states have call successors, (152), 13 states have call predecessors, (152), 13 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-10 04:29:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 705 transitions. [2024-11-10 04:29:00,750 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 705 transitions. Word has length 205 [2024-11-10 04:29:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:29:00,751 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 705 transitions. [2024-11-10 04:29:00,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:29:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 705 transitions. [2024-11-10 04:29:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-10 04:29:00,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:29:00,753 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:00,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 04:29:00,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:29:00,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:29:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash 616265836, now seen corresponding path program 1 times [2024-11-10 04:29:00,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:29:00,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156451570] [2024-11-10 04:29:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:29:00,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:29:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:29:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872564924] [2024-11-10 04:29:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:29:00,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:29:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:29:00,854 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 04:29:00,855 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 04:29:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:29:00,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 04:29:00,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:29:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 905 proven. 204 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2024-11-10 04:29:02,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:29:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:29:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156451570] [2024-11-10 04:29:03,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:29:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872564924] [2024-11-10 04:29:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872564924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:29:03,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:29:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-10 04:29:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394341775] [2024-11-10 04:29:03,548 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 04:29:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 04:29:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:29:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 04:29:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-10 04:29:03,550 INFO L87 Difference]: Start difference. First operand 488 states and 705 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-10 04:29:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:29:04,356 INFO L93 Difference]: Finished difference Result 1199 states and 1612 transitions. [2024-11-10 04:29:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-10 04:29:04,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) Word has length 206 [2024-11-10 04:29:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:29:04,362 INFO L225 Difference]: With dead ends: 1199 [2024-11-10 04:29:04,363 INFO L226 Difference]: Without dead ends: 785 [2024-11-10 04:29:04,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 04:29:04,365 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 164 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:29:04,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 384 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 464 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:29:04,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-10 04:29:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 669. [2024-11-10 04:29:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 450 states have (on average 1.18) internal successors, (531), 461 states have internal predecessors, (531), 180 states have call successors, (180), 38 states have call predecessors, (180), 38 states have return successors, (180), 169 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 04:29:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 891 transitions. [2024-11-10 04:29:04,463 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 891 transitions. Word has length 206 [2024-11-10 04:29:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:29:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 891 transitions. [2024-11-10 04:29:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-10 04:29:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 891 transitions. [2024-11-10 04:29:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-10 04:29:04,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:29:04,465 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:04,485 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 04:29:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 04:29:04,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:29:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:29:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 644894987, now seen corresponding path program 1 times [2024-11-10 04:29:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:29:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098594738] [2024-11-10 04:29:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:29:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:29:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:29:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257463690] [2024-11-10 04:29:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:29:04,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:29:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:29:04,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:29:04,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:29:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:29:04,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:29:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:29:05,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:29:05,062 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:29:05,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:29:05,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:29:05,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 04:29:05,268 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:29:05,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:29:05,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:29:05 BoogieIcfgContainer [2024-11-10 04:29:05,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:29:05,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:29:05,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:29:05,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:29:05,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:27:50" (3/4) ... [2024-11-10 04:29:05,412 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:29:05,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:29:05,413 INFO L158 Benchmark]: Toolchain (without parser) took 76400.78ms. Allocated memory was 155.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 82.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 182.4MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,414 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:29:05,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.75ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 81.7MB in the beginning and 170.3MB in the end (delta: -88.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.98ms. Allocated memory is still 199.2MB. Free memory was 170.3MB in the beginning and 166.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,414 INFO L158 Benchmark]: Boogie Preprocessor took 69.16ms. Allocated memory is still 199.2MB. Free memory was 166.1MB in the beginning and 161.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,415 INFO L158 Benchmark]: IcfgBuilder took 690.81ms. Allocated memory is still 199.2MB. Free memory was 161.9MB in the beginning and 136.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,415 INFO L158 Benchmark]: TraceAbstraction took 75190.03ms. Allocated memory was 199.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 135.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2024-11-10 04:29:05,416 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:29:05,417 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.21ms. Allocated memory is still 155.2MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.75ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 81.7MB in the beginning and 170.3MB in the end (delta: -88.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.98ms. Allocated memory is still 199.2MB. Free memory was 170.3MB in the beginning and 166.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.16ms. Allocated memory is still 199.2MB. Free memory was 166.1MB in the beginning and 161.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 690.81ms. Allocated memory is still 199.2MB. Free memory was 161.9MB in the beginning and 136.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 75190.03ms. Allocated memory was 199.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 135.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB 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 someBinaryDOUBLEComparisonOperation at line 174. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned char var_1_23 = 1; [L41] signed long int var_1_24 = 5; [L42] signed long int var_1_25 = -128; [L43] unsigned long int var_1_26 = 10; [L44] unsigned long int var_1_27 = 5; [L45] signed long int var_1_28 = -10000; [L46] signed long int var_1_29 = -1263929197; [L47] signed long int var_1_30 = 500; [L48] signed short int var_1_31 = 1; [L49] signed short int var_1_32 = -500; [L50] signed long int var_1_33 = 32; [L51] signed long int var_1_34 = -1000000; [L52] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L121] var_1_3 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L122] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L123] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L123] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] var_1_4 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L125] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L126] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L126] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L128] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L129] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L129] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L132] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L132] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L133] var_1_10 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L134] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L135] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L135] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L136] var_1_11 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L137] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L138] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L138] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L139] var_1_14 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L140] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L141] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L141] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L142] var_1_20 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L143] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L144] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L144] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L145] var_1_21 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L146] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L147] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L147] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L148] var_1_23 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L149] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L150] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L150] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L151] var_1_24 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_24 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L152] RET assume_abort_if_not(var_1_24 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L153] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L153] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L154] var_1_25 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L155] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L156] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L156] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L157] var_1_27 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L158] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L159] CALL assume_abort_if_not(var_1_27 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L159] RET assume_abort_if_not(var_1_27 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-1263929197, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L160] var_1_29 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L161] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L162] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L162] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=500, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L163] var_1_30 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L165] CALL assume_abort_if_not(var_1_30 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L165] RET assume_abort_if_not(var_1_30 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=-500, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L166] var_1_32 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_32 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L167] RET assume_abort_if_not(var_1_32 >= -32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L168] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L168] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L182] RET updateVariables() [L183] CALL step() [L56] COND FALSE !(var_1_24 > var_1_25) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L61] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-10000, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L62] COND FALSE !(((((-256) < 0 ) ? -(-256) : (-256))) < var_1_24) [L65] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=1, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L67] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=32, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L68] COND TRUE var_1_31 < var_1_26 [L69] var_1_33 = ((((var_1_30) < ((var_1_31 + 1))) ? (var_1_30) : ((var_1_31 + 1)))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=-1000000, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L73] COND TRUE var_1_26 < var_1_28 [L74] var_1_34 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L76] signed char stepLocal_1 = var_1_6; [L77] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L78] COND FALSE !(-25 == stepLocal_1) [L83] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L85] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L86] COND TRUE var_1_8 >= stepLocal_2 [L87] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L89] COND TRUE \read(var_1_12) [L90] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L92] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L93] COND TRUE \read(var_1_12) [L94] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L97] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L98] COND TRUE var_1_1 < stepLocal_4 [L99] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L103] COND TRUE \read(var_1_12) [L104] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L106] COND TRUE -64 > (var_1_6 + var_1_19) [L107] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L115] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49279, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L116] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L183] RET step() [L184] CALL, EXPR property() [L174-L175] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=1, var_1_27=1, var_1_28=-2147483646, var_1_29=-2147483646, var_1_30=2, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=0, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.0s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2056 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 7228 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5606 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4033 IncrementalHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 1622 mSDtfsCounter, 4033 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1061 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=11, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 712 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 56.5s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2245 ConstructedInterpolants, 1 QuantifiedInterpolants, 18205 SizeOfPredicates, 7 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 21620/21824 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 04:29:05,635 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 04:29:05,675 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 137 Received shutdown request...