./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-50_file-78.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 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:42:41,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:42:41,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:42:41,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:42:41,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:42:41,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:42:41,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:42:41,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:42:41,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:42:41,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:42:41,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:42:41,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:42:41,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:42:41,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:42:41,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:42:41,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:42:41,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:42:41,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:42:41,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:42:41,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:42:41,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:42:41,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:42:41,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:42:41,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:42:41,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:42:41,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:42:41,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:42:41,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:42:41,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:42:41,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:42:41,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:42:41,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:42:41,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:42:41,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:42:41,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:42:41,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:42:41,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:42:41,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:42:41,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:42:41,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:42:41,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:42:41,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:42:41,740 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 -> 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 [2024-11-12 02:42:41,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:42:42,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:42:42,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:42:42,020 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:42:42,020 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:42:42,022 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-50_file-78.i [2024-11-12 02:42:43,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:42:43,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:42:43,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2024-11-12 02:42:43,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f659f21c/231dfe653f0348789e5aa8f2d1db5023/FLAG113f2a191 [2024-11-12 02:42:43,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f659f21c/231dfe653f0348789e5aa8f2d1db5023 [2024-11-12 02:42:43,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:42:43,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:42:43,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:42:43,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:42:43,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:42:43,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:42:43" (1/1) ... [2024-11-12 02:42:43,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502a8ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:43, skipping insertion in model container [2024-11-12 02:42:43,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:42:43" (1/1) ... [2024-11-12 02:42:43,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:42:44,027 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-50_file-78.i[915,928] [2024-11-12 02:42:44,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:42:44,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:42:44,179 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-50_file-78.i[915,928] [2024-11-12 02:42:44,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:42:44,242 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:42:44,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44 WrapperNode [2024-11-12 02:42:44,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:42:44,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:42:44,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:42:44,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:42:44,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,335 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 286 [2024-11-12 02:42:44,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:42:44,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:42:44,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:42:44,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:42:44,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,406 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-12 02:42:44,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:42:44,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:42:44,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:42:44,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:42:44,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (1/1) ... [2024-11-12 02:42:44,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:42:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:42:44,492 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-12 02:42:44,495 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-12 02:42:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:42:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:42:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:42:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:42:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:42:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:42:44,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:42:44,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:42:45,297 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 02:42:45,298 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:42:45,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:42:45,320 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:42:45,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:42:45 BoogieIcfgContainer [2024-11-12 02:42:45,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:42:45,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:42:45,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:42:45,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:42:45,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:42:43" (1/3) ... [2024-11-12 02:42:45,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4365c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:42:45, skipping insertion in model container [2024-11-12 02:42:45,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:42:44" (2/3) ... [2024-11-12 02:42:45,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4365c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:42:45, skipping insertion in model container [2024-11-12 02:42:45,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:42:45" (3/3) ... [2024-11-12 02:42:45,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2024-11-12 02:42:45,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:42:45,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:42:45,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:42:45,428 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;@6772ec9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:42:45,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:42:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:42:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 02:42:45,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:45,454 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:45,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1899749707, now seen corresponding path program 1 times [2024-11-12 02:42:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952772187] [2024-11-12 02:42:45,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:46,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952772187] [2024-11-12 02:42:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952772187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:46,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:42:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790893378] [2024-11-12 02:42:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:46,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:42:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:42:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:42:46,164 INFO L87 Difference]: Start difference. First operand has 121 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 02:42:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:46,213 INFO L93 Difference]: Finished difference Result 235 states and 410 transitions. [2024-11-12 02:42:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:42:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 220 [2024-11-12 02:42:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:46,225 INFO L225 Difference]: With dead ends: 235 [2024-11-12 02:42:46,226 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 02:42:46,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-12 02:42:46,239 INFO L435 NwaCegarLoop]: 184 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, 184 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-12 02:42:46,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:42:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 02:42:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 02:42:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:42:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2024-11-12 02:42:46,301 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 220 [2024-11-12 02:42:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2024-11-12 02:42:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 02:42:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2024-11-12 02:42:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 02:42:46,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:46,346 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:42:46,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:46,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 977928023, now seen corresponding path program 1 times [2024-11-12 02:42:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468220028] [2024-11-12 02:42:46,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:46,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468220028] [2024-11-12 02:42:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468220028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:42:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028666139] [2024-11-12 02:42:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:42:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:42:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:46,838 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:46,900 INFO L93 Difference]: Finished difference Result 231 states and 365 transitions. [2024-11-12 02:42:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:42:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-11-12 02:42:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:46,907 INFO L225 Difference]: With dead ends: 231 [2024-11-12 02:42:46,907 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 02:42:46,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:46,909 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:46,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:42:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 02:42:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 02:42:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:42:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2024-11-12 02:42:46,931 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 220 [2024-11-12 02:42:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:46,935 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2024-11-12 02:42:46,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2024-11-12 02:42:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-12 02:42:46,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:46,943 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:42:46,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 465218457, now seen corresponding path program 1 times [2024-11-12 02:42:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773321468] [2024-11-12 02:42:46,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:47,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:47,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773321468] [2024-11-12 02:42:47,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773321468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:47,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:47,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:42:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732401077] [2024-11-12 02:42:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:42:47,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:42:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:47,543 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:47,802 INFO L93 Difference]: Finished difference Result 346 states and 544 transitions. [2024-11-12 02:42:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:42:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2024-11-12 02:42:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:47,806 INFO L225 Difference]: With dead ends: 346 [2024-11-12 02:42:47,806 INFO L226 Difference]: Without dead ends: 232 [2024-11-12 02:42:47,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:42:47,808 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 152 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:47,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 506 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:42:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-12 02:42:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2024-11-12 02:42:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 02:42:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 340 transitions. [2024-11-12 02:42:47,873 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 340 transitions. Word has length 221 [2024-11-12 02:42:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 340 transitions. [2024-11-12 02:42:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2024-11-12 02:42:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-12 02:42:47,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:47,880 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:47,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:42:47,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:47,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1749872955, now seen corresponding path program 1 times [2024-11-12 02:42:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345375152] [2024-11-12 02:42:47,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345375152] [2024-11-12 02:42:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345375152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:48,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:42:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180925227] [2024-11-12 02:42:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:42:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:42:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:48,288 INFO L87 Difference]: Start difference. First operand 215 states and 340 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:48,540 INFO L93 Difference]: Finished difference Result 481 states and 754 transitions. [2024-11-12 02:42:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:42:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2024-11-12 02:42:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:48,544 INFO L225 Difference]: With dead ends: 481 [2024-11-12 02:42:48,544 INFO L226 Difference]: Without dead ends: 352 [2024-11-12 02:42:48,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:42:48,546 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 190 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:48,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 533 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:42:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-12 02:42:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2024-11-12 02:42:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 228 states have (on average 1.412280701754386) internal successors, (322), 228 states have internal predecessors, (322), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 02:42:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 526 transitions. [2024-11-12 02:42:48,618 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 526 transitions. Word has length 222 [2024-11-12 02:42:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:48,619 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 526 transitions. [2024-11-12 02:42:48,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 526 transitions. [2024-11-12 02:42:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 02:42:48,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:48,622 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:48,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:42:48,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:48,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1906342836, now seen corresponding path program 1 times [2024-11-12 02:42:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569135532] [2024-11-12 02:42:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569135532] [2024-11-12 02:42:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569135532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:42:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742475834] [2024-11-12 02:42:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:49,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:42:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:42:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:42:49,034 INFO L87 Difference]: Start difference. First operand 334 states and 526 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:49,139 INFO L93 Difference]: Finished difference Result 819 states and 1291 transitions. [2024-11-12 02:42:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:42:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2024-11-12 02:42:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:49,148 INFO L225 Difference]: With dead ends: 819 [2024-11-12 02:42:49,148 INFO L226 Difference]: Without dead ends: 582 [2024-11-12 02:42:49,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 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-12 02:42:49,151 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 112 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:49,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 524 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:42:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-12 02:42:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2024-11-12 02:42:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 404 states have internal predecessors, (574), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-12 02:42:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 914 transitions. [2024-11-12 02:42:49,235 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 914 transitions. Word has length 223 [2024-11-12 02:42:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:49,237 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 914 transitions. [2024-11-12 02:42:49,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 914 transitions. [2024-11-12 02:42:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 02:42:49,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:49,240 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:49,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:42:49,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1513315826, now seen corresponding path program 1 times [2024-11-12 02:42:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783645325] [2024-11-12 02:42:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:49,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783645325] [2024-11-12 02:42:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783645325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:42:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374071878] [2024-11-12 02:42:49,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:49,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:42:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:49,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:42:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:49,840 INFO L87 Difference]: Start difference. First operand 580 states and 914 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:50,149 INFO L93 Difference]: Finished difference Result 1136 states and 1773 transitions. [2024-11-12 02:42:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:42:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2024-11-12 02:42:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:50,157 INFO L225 Difference]: With dead ends: 1136 [2024-11-12 02:42:50,157 INFO L226 Difference]: Without dead ends: 642 [2024-11-12 02:42:50,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:42:50,161 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 144 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:50,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 506 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:42:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-12 02:42:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 588. [2024-11-12 02:42:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-12 02:42:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 921 transitions. [2024-11-12 02:42:50,236 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 921 transitions. Word has length 223 [2024-11-12 02:42:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:50,236 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 921 transitions. [2024-11-12 02:42:50,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 921 transitions. [2024-11-12 02:42:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 02:42:50,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:50,240 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 02:42:50,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 195638592, now seen corresponding path program 1 times [2024-11-12 02:42:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665354031] [2024-11-12 02:42:50,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665354031] [2024-11-12 02:42:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665354031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:50,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:50,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:42:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588844103] [2024-11-12 02:42:50,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:50,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:42:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:42:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:42:50,785 INFO L87 Difference]: Start difference. First operand 588 states and 921 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:51,183 INFO L93 Difference]: Finished difference Result 1439 states and 2239 transitions. [2024-11-12 02:42:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:42:51,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2024-11-12 02:42:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:51,190 INFO L225 Difference]: With dead ends: 1439 [2024-11-12 02:42:51,190 INFO L226 Difference]: Without dead ends: 933 [2024-11-12 02:42:51,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:42:51,193 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 234 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:51,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 619 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:42:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-12 02:42:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 829. [2024-11-12 02:42:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 583 states have (on average 1.4065180102915953) internal successors, (820), 583 states have internal predecessors, (820), 238 states have call successors, (238), 7 states have call predecessors, (238), 7 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2024-11-12 02:42:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1296 transitions. [2024-11-12 02:42:51,295 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1296 transitions. Word has length 224 [2024-11-12 02:42:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:51,295 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1296 transitions. [2024-11-12 02:42:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1296 transitions. [2024-11-12 02:42:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 02:42:51,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:51,298 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:51,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 02:42:51,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 414493310, now seen corresponding path program 1 times [2024-11-12 02:42:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349712903] [2024-11-12 02:42:51,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:51,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:51,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349712903] [2024-11-12 02:42:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349712903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:51,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:42:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050419616] [2024-11-12 02:42:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:42:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:42:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:42:51,716 INFO L87 Difference]: Start difference. First operand 829 states and 1296 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:51,924 INFO L93 Difference]: Finished difference Result 1667 states and 2604 transitions. [2024-11-12 02:42:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:42:51,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2024-11-12 02:42:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:51,931 INFO L225 Difference]: With dead ends: 1667 [2024-11-12 02:42:51,931 INFO L226 Difference]: Without dead ends: 977 [2024-11-12 02:42:51,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-12 02:42:51,935 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 71 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:51,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 691 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:42:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-12 02:42:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 907. [2024-11-12 02:42:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 661 states have (on average 1.4024205748865355) internal successors, (927), 661 states have internal predecessors, (927), 238 states have call successors, (238), 7 states have call predecessors, (238), 7 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2024-11-12 02:42:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1403 transitions. [2024-11-12 02:42:52,029 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1403 transitions. Word has length 224 [2024-11-12 02:42:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1403 transitions. [2024-11-12 02:42:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1403 transitions. [2024-11-12 02:42:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-12 02:42:52,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:52,033 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 02:42:52,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -325922568, now seen corresponding path program 1 times [2024-11-12 02:42:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123584710] [2024-11-12 02:42:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 02:42:52,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123584710] [2024-11-12 02:42:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123584710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:42:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245744381] [2024-11-12 02:42:52,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:52,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:42:52,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:42:52,428 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-12 02:42:52,430 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-12 02:42:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:52,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:42:52,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:42:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 945 proven. 27 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2024-11-12 02:42:52,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:42:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 02:42:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245744381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:42:53,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:42:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-12 02:42:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49281517] [2024-11-12 02:42:53,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:42:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 02:42:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:53,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 02:42:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:42:53,113 INFO L87 Difference]: Start difference. First operand 907 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-12 02:42:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:53,570 INFO L93 Difference]: Finished difference Result 1820 states and 2763 transitions. [2024-11-12 02:42:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 02:42:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 229 [2024-11-12 02:42:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:53,579 INFO L225 Difference]: With dead ends: 1820 [2024-11-12 02:42:53,579 INFO L226 Difference]: Without dead ends: 977 [2024-11-12 02:42:53,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-12 02:42:53,586 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 202 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:53,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 307 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:42:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-12 02:42:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 963. [2024-11-12 02:42:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 703 states have (on average 1.298719772403983) internal successors, (913), 703 states have internal predecessors, (913), 238 states have call successors, (238), 21 states have call predecessors, (238), 21 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2024-11-12 02:42:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1389 transitions. [2024-11-12 02:42:53,703 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1389 transitions. Word has length 229 [2024-11-12 02:42:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:53,705 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1389 transitions. [2024-11-12 02:42:53,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-11-12 02:42:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1389 transitions. [2024-11-12 02:42:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-12 02:42:53,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:53,708 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:53,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 02:42:53,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:42:53,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:53,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1908447428, now seen corresponding path program 1 times [2024-11-12 02:42:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110415162] [2024-11-12 02:42:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:42:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:42:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:42:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:42:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:42:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:42:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:42:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:42:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:42:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 02:42:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:42:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 02:42:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:42:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:42:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:42:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:42:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:42:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:42:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:42:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:42:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:42:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:42:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:42:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:42:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:42:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:42:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:42:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:42:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:42:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 02:42:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 02:42:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 02:42:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 02:42:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 02:42:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:42:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:42:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:42:54,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110415162] [2024-11-12 02:42:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110415162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:42:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:42:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:42:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412291289] [2024-11-12 02:42:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:42:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:42:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:42:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:42:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:54,208 INFO L87 Difference]: Start difference. First operand 963 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:42:54,381 INFO L93 Difference]: Finished difference Result 2498 states and 3620 transitions. [2024-11-12 02:42:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:42:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 234 [2024-11-12 02:42:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:42:54,394 INFO L225 Difference]: With dead ends: 2498 [2024-11-12 02:42:54,395 INFO L226 Difference]: Without dead ends: 1623 [2024-11-12 02:42:54,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:42:54,399 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 122 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:42:54,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 502 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:42:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-11-12 02:42:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1615. [2024-11-12 02:42:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1228 states have (on average 1.3249185667752443) internal successors, (1627), 1234 states have internal predecessors, (1627), 358 states have call successors, (358), 28 states have call predecessors, (358), 28 states have return successors, (358), 352 states have call predecessors, (358), 358 states have call successors, (358) [2024-11-12 02:42:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2343 transitions. [2024-11-12 02:42:54,605 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2343 transitions. Word has length 234 [2024-11-12 02:42:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:42:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2343 transitions. [2024-11-12 02:42:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:42:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2343 transitions. [2024-11-12 02:42:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-12 02:42:54,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:42:54,609 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:42:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 02:42:54,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:42:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:42:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash -522244034, now seen corresponding path program 1 times [2024-11-12 02:42:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:42:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390412758] [2024-11-12 02:42:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:42:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:42:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809377366] [2024-11-12 02:42:54,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:42:54,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:42:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:42:54,773 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-12 02:42:54,774 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-12 02:42:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:42:54,979 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:42:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:42:55,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:42:55,215 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:42:55,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:42:55,229 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-12 02:42:55,419 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,SelfDestructingSolverStorable10 [2024-11-12 02:42:55,423 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:42:55,586 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:42:55,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:42:55 BoogieIcfgContainer [2024-11-12 02:42:55,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:42:55,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:42:55,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:42:55,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:42:55,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:42:45" (3/4) ... [2024-11-12 02:42:55,593 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:42:55,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:42:55,595 INFO L158 Benchmark]: Toolchain (without parser) took 11787.22ms. Allocated memory was 167.8MB in the beginning and 348.1MB in the end (delta: 180.4MB). Free memory was 114.5MB in the beginning and 172.4MB in the end (delta: -57.9MB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 134.7MB in the end (delta: 161.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:42:55,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.97ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 94.9MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.17ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 85.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,596 INFO L158 Benchmark]: Boogie Preprocessor took 116.88ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 73.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,597 INFO L158 Benchmark]: RCFGBuilder took 865.88ms. Allocated memory is still 167.8MB. Free memory was 73.3MB in the beginning and 117.2MB in the end (delta: -44.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,597 INFO L158 Benchmark]: TraceAbstraction took 10266.89ms. Allocated memory was 167.8MB in the beginning and 348.1MB in the end (delta: 180.4MB). Free memory was 116.7MB in the beginning and 172.4MB in the end (delta: -55.7MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2024-11-12 02:42:55,597 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 348.1MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:42:55,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 134.7MB in the end (delta: 161.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.97ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 94.9MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.17ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 85.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.88ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 73.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 865.88ms. Allocated memory is still 167.8MB. Free memory was 73.3MB in the beginning and 117.2MB in the end (delta: -44.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10266.89ms. Allocated memory was 167.8MB in the beginning and 348.1MB in the end (delta: 180.4MB). Free memory was 116.7MB in the beginning and 172.4MB in the end (delta: -55.7MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 348.1MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of bitwiseOr at line 191, overapproximation of someBinaryArithmeticDOUBLEoperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] signed long int var_1_25 = -64; [L45] unsigned short int var_1_26 = 26914; [L46] unsigned short int var_1_27 = 26182; [L47] unsigned char var_1_28 = 5; [L48] unsigned char var_1_29 = 50; [L49] unsigned char var_1_30 = 10; [L50] signed long int var_1_31 = -32; [L51] unsigned char var_1_32 = 0; [L52] unsigned char var_1_33 = 1; [L53] unsigned char var_1_34 = 0; [L54] signed long int var_1_35 = 1000000; [L55] signed long int var_1_36 = 64; [L56] unsigned char last_1_var_1_3 = 64; [L57] unsigned short int last_1_var_1_6 = 10; [L58] unsigned short int last_1_var_1_15 = 5; [L59] unsigned short int last_1_var_1_20 = 50; [L60] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L184] last_1_var_1_3 = var_1_3 [L185] last_1_var_1_6 = var_1_6 [L186] last_1_var_1_15 = var_1_15 [L187] last_1_var_1_20 = var_1_20 [L188] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L129] var_1_4 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] var_1_5 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] var_1_10 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] var_1_11 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] var_1_12 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] var_1_17 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] var_1_18 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] var_1_25 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] var_1_26 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] var_1_27 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L174] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L176] var_1_33 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L177] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L199] RET updateVariables() [L200] CALL step() [L64] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L65] COND TRUE ((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23))) >= var_1_25 [L66] var_1_24 = ((var_1_26 + var_1_27) - var_1_23) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] COND TRUE var_1_27 > 0 [L69] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L71] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L72] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L76] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] COND TRUE (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_25 [L78] var_1_32 = (! var_1_33) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L83] var_1_35 = ((((var_1_26) > (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_26) : (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L84] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] COND FALSE !(var_1_25 >= var_1_22) [L94] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L102] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L110] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L111] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L112] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L118] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L119] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L120] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L121] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L121] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L124] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L125] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191-L192] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1228 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1227 mSDsluCounter, 4907 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3193 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 562 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 1714 mSDtfsCounter, 562 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1232 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1615occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 287 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2937 NumberOfCodeBlocks, 2937 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2686 ConstructedInterpolants, 0 QuantifiedInterpolants, 6312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 26841/26928 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-12 02:42:55,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-50_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:42:58,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:42:58,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:42:58,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:42:58,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:42:58,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:42:58,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:42:58,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:42:58,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:42:58,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:42:58,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:42:58,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:42:58,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:42:58,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:42:58,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:42:58,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:42:58,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:42:58,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:42:58,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:42:58,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:42:58,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:42:58,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:42:58,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:42:58,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:42:58,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:42:58,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:42:58,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:42:58,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:42:58,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:42:58,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:42:58,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:42:58,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:42:58,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:42:58,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:42:58,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:42:58,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:42:58,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:42:58,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:42:58,281 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:42:58,281 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:42:58,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:42:58,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:42:58,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:42:58,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:42:58,285 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 -> 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 [2024-11-12 02:42:58,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:42:58,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:42:58,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:42:58,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:42:58,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:42:58,683 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-50_file-78.i [2024-11-12 02:43:00,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:43:00,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:43:00,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2024-11-12 02:43:00,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1417cb62/10839d70cdf04352b63a866ddd1bcbec/FLAG6c144e171 [2024-11-12 02:43:00,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1417cb62/10839d70cdf04352b63a866ddd1bcbec [2024-11-12 02:43:00,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:43:00,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:43:00,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:43:00,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:43:00,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:43:00,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:43:00" (1/1) ... [2024-11-12 02:43:00,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4e3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:00, skipping insertion in model container [2024-11-12 02:43:00,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:43:00" (1/1) ... [2024-11-12 02:43:00,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:43:00,774 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-50_file-78.i[915,928] [2024-11-12 02:43:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:43:00,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:43:00,911 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-50_file-78.i[915,928] [2024-11-12 02:43:00,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:43:00,999 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:43:01,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01 WrapperNode [2024-11-12 02:43:01,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:43:01,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:43:01,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:43:01,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:43:01,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,069 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-12 02:43:01,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:43:01,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:43:01,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:43:01,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:43:01,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,120 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-12 02:43:01,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:43:01,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:43:01,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:43:01,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:43:01,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (1/1) ... [2024-11-12 02:43:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:43:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:43:01,196 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-12 02:43:01,200 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-12 02:43:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:43:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:43:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:43:01,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:43:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:43:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:43:01,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:43:01,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:43:08,162 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 02:43:08,163 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:43:08,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:43:08,184 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:43:08,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:43:08 BoogieIcfgContainer [2024-11-12 02:43:08,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:43:08,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:43:08,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:43:08,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:43:08,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:43:00" (1/3) ... [2024-11-12 02:43:08,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd0b765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:43:08, skipping insertion in model container [2024-11-12 02:43:08,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:43:01" (2/3) ... [2024-11-12 02:43:08,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd0b765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:43:08, skipping insertion in model container [2024-11-12 02:43:08,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:43:08" (3/3) ... [2024-11-12 02:43:08,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2024-11-12 02:43:08,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:43:08,208 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:43:08,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:43:08,290 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;@78ebd030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:43:08,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:43:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:43:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-12 02:43:08,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:08,314 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:08,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1995552549, now seen corresponding path program 1 times [2024-11-12 02:43:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:08,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744313154] [2024-11-12 02:43:08,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:08,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:08,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:08,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:08,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 02:43:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:08,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:43:08,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2024-11-12 02:43:09,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:43:09,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:43:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744313154] [2024-11-12 02:43:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744313154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:43:09,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:43:09,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:43:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233944068] [2024-11-12 02:43:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:43:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:43:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:43:09,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:43:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:43:09,080 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 02:43:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:43:09,123 INFO L93 Difference]: Finished difference Result 179 states and 318 transitions. [2024-11-12 02:43:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:43:09,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2024-11-12 02:43:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:43:09,133 INFO L225 Difference]: With dead ends: 179 [2024-11-12 02:43:09,133 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 02:43:09,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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-12 02:43:09,140 INFO L435 NwaCegarLoop]: 138 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, 138 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-12 02:43:09,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:43:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 02:43:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 02:43:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:43:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2024-11-12 02:43:09,201 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 214 [2024-11-12 02:43:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:43:09,202 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2024-11-12 02:43:09,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 02:43:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2024-11-12 02:43:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-12 02:43:09,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:09,210 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:09,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 02:43:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:09,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1180622823, now seen corresponding path program 1 times [2024-11-12 02:43:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108640094] [2024-11-12 02:43:09,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:09,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:09,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:09,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:43:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:09,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 02:43:09,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 956 proven. 48 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-11-12 02:43:11,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:43:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 02:43:12,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:43:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108640094] [2024-11-12 02:43:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108640094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:43:12,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:43:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-12 02:43:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996345446] [2024-11-12 02:43:12,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:43:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:43:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:43:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:43:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:43:12,525 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-12 02:43:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:43:14,298 INFO L93 Difference]: Finished difference Result 185 states and 281 transitions. [2024-11-12 02:43:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 02:43:14,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 214 [2024-11-12 02:43:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:43:14,303 INFO L225 Difference]: With dead ends: 185 [2024-11-12 02:43:14,303 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 02:43:14,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-12 02:43:14,309 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 140 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:43:14,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 279 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 02:43:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 02:43:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-12 02:43:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:43:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-11-12 02:43:14,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 214 [2024-11-12 02:43:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:43:14,329 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-11-12 02:43:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-12 02:43:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-11-12 02:43:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-12 02:43:14,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:14,341 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:14,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 02:43:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:14,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:14,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1425400731, now seen corresponding path program 1 times [2024-11-12 02:43:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:14,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410767100] [2024-11-12 02:43:14,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:14,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:14,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 02:43:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:14,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 02:43:14,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1058 proven. 60 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2024-11-12 02:43:16,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:43:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 02:43:17,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:43:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410767100] [2024-11-12 02:43:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410767100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:43:17,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:43:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-12 02:43:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841050519] [2024-11-12 02:43:17,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:43:17,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:43:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:43:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:43:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:43:17,573 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-12 02:43:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:43:19,227 INFO L93 Difference]: Finished difference Result 201 states and 289 transitions. [2024-11-12 02:43:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 02:43:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 214 [2024-11-12 02:43:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:43:19,231 INFO L225 Difference]: With dead ends: 201 [2024-11-12 02:43:19,231 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 02:43:19,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-12 02:43:19,233 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 179 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:43:19,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 258 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 02:43:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 02:43:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-12 02:43:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:43:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-12 02:43:19,250 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 214 [2024-11-12 02:43:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:43:19,250 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-12 02:43:19,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-12 02:43:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-12 02:43:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 02:43:19,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:19,254 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:19,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 02:43:19,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:19,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:19,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 195899041, now seen corresponding path program 1 times [2024-11-12 02:43:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101424259] [2024-11-12 02:43:19,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:19,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:19,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:19,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 02:43:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:19,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 02:43:19,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:43:19,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:43:19,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:43:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101424259] [2024-11-12 02:43:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101424259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:43:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:43:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:43:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678478409] [2024-11-12 02:43:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:43:19,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:43:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:43:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:43:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:43:19,909 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:43:24,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 02:43:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:43:24,084 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2024-11-12 02:43:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:43:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-11-12 02:43:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:43:24,121 INFO L225 Difference]: With dead ends: 207 [2024-11-12 02:43:24,121 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 02:43:24,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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-12 02:43:24,123 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:43:24,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 02:43:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 02:43:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-12 02:43:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 02:43:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-12 02:43:24,139 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 216 [2024-11-12 02:43:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:43:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-12 02:43:24,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:43:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-12 02:43:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 02:43:24,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:24,149 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:24,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 02:43:24,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:24,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:24,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1331202390, now seen corresponding path program 1 times [2024-11-12 02:43:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034218279] [2024-11-12 02:43:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:24,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:24,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:24,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 02:43:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:25,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 02:43:25,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 693 proven. 81 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2024-11-12 02:43:29,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:43:34,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:43:34,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034218279] [2024-11-12 02:43:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034218279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:43:34,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [617720131] [2024-11-12 02:43:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:34,298 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 02:43:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 02:43:34,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 02:43:34,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-12 02:43:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:35,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 02:43:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:43:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 02:43:38,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:43:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [617720131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:43:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 02:43:38,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 02:43:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633918079] [2024-11-12 02:43:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:43:38,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:43:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:43:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:43:38,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:43:38,508 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:43:41,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:43:43,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:43:46,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:43:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:43:47,047 INFO L93 Difference]: Finished difference Result 330 states and 452 transitions. [2024-11-12 02:43:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:43:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-11-12 02:43:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:43:47,051 INFO L225 Difference]: With dead ends: 330 [2024-11-12 02:43:47,051 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 02:43:47,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:43:47,052 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 50 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:43:47,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 353 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-12 02:43:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 02:43:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 223. [2024-11-12 02:43:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 142 states have internal predecessors, (167), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 02:43:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 307 transitions. [2024-11-12 02:43:47,100 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 307 transitions. Word has length 217 [2024-11-12 02:43:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:43:47,102 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 307 transitions. [2024-11-12 02:43:47,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 02:43:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 307 transitions. [2024-11-12 02:43:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 02:43:47,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:43:47,106 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:43:47,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-12 02:43:47,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 02:43:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:47,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:43:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:43:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 938175380, now seen corresponding path program 1 times [2024-11-12 02:43:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:43:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979694339] [2024-11-12 02:43:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:43:47,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:43:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:43:47,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:43:47,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 02:43:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:43:48,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-12 02:43:48,451 INFO L279 TraceCheckSpWp]: Computing forward predicates...