/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:52:15,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:52:15,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:52:15,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:52:15,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:52:15,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:52:15,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:52:15,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:52:15,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:52:15,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:52:15,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:52:15,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:52:15,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:52:15,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:52:15,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:52:15,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:52:15,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:52:15,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:52:15,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:52:15,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:52:15,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:52:15,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:52:15,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:52:15,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:52:15,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:52:15,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:52:15,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:52:15,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:52:15,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:52:15,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:52:15,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:52:15,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:52:15,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:52:15,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:52:15,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:52:15,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:52:15,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:52:15,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:52:15,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:52:15,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:52:15,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:52:15,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:52:15,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:52:15,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:52:15,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:52:15,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:52:15,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:52:15,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:52:15,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:52:15,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:52:15,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:52:15,343 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:52:15,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:52:15,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:52:15,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:52:15,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:52:15,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:52:15,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:52:15,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:52:15,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:52:15,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:52:15,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:52:15,525 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:52:15,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2022-04-27 10:52:15,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ae5add8/0fc7b868b2bb498d85cc36f639ecac35/FLAG37f6f760b [2022-04-27 10:52:15,874 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:52:15,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2022-04-27 10:52:15,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ae5add8/0fc7b868b2bb498d85cc36f639ecac35/FLAG37f6f760b [2022-04-27 10:52:16,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ae5add8/0fc7b868b2bb498d85cc36f639ecac35 [2022-04-27 10:52:16,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:52:16,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:52:16,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:52:16,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:52:16,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:52:16,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f86dcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16, skipping insertion in model container [2022-04-27 10:52:16,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:52:16,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:52:16,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i[895,908] [2022-04-27 10:52:16,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:52:16,541 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:52:16,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i[895,908] [2022-04-27 10:52:16,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:52:16,560 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:52:16,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16 WrapperNode [2022-04-27 10:52:16,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:52:16,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:52:16,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:52:16,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:52:16,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:52:16,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:52:16,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:52:16,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:52:16,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (1/1) ... [2022-04-27 10:52:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:52:16,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:16,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:52:16,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:52:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:52:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:52:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:52:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:52:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:52:16,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:52:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:52:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:52:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:52:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:52:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:52:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:52:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:52:16,696 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:52:16,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:52:16,779 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:52:16,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:52:16,784 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:52:16,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:52:16 BoogieIcfgContainer [2022-04-27 10:52:16,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:52:16,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:52:16,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:52:16,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:52:16,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:52:16" (1/3) ... [2022-04-27 10:52:16,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acb1dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:52:16, skipping insertion in model container [2022-04-27 10:52:16,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:52:16" (2/3) ... [2022-04-27 10:52:16,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acb1dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:52:16, skipping insertion in model container [2022-04-27 10:52:16,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:52:16" (3/3) ... [2022-04-27 10:52:16,790 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.i [2022-04-27 10:52:16,813 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:52:16,813 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:52:16,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:52:16,885 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f121d6a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8576062 [2022-04-27 10:52:16,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:52:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:52:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:52:16,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:16,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:16,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -242008288, now seen corresponding path program 1 times [2022-04-27 10:52:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:16,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073084308] [2022-04-27 10:52:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:52:17,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:52:17,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-27 10:52:17,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:17,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-27 10:52:17,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:52:17,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-27 10:52:17,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2022-04-27 10:52:17,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 50; {23#true} is VALID [2022-04-27 10:52:17,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 10:52:17,021 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {24#false} is VALID [2022-04-27 10:52:17,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 10:52:17,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:52:17,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:52:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:17,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073084308] [2022-04-27 10:52:17,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073084308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:17,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:17,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:52:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934537323] [2022-04-27 10:52:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:52:17,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:17,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:52:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:52:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:52:17,058 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,115 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 10:52:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:52:17,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:52:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 10:52:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 10:52:17,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 10:52:17,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,182 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:52:17,182 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:52:17,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:52:17,186 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:17,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:52:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:52:17,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:17,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,206 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,206 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,207 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:52:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:52:17,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:52:17,208 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:52:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,210 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:52:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:52:17,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:17,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 10:52:17,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 10:52:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:17,213 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 10:52:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:52:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:52:17,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:17,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:17,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:52:17,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash -251243498, now seen corresponding path program 1 times [2022-04-27 10:52:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:17,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98771650] [2022-04-27 10:52:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {118#true} is VALID [2022-04-27 10:52:17,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 10:52:17,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #56#return; {118#true} is VALID [2022-04-27 10:52:17,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:17,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {118#true} is VALID [2022-04-27 10:52:17,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 10:52:17,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #56#return; {118#true} is VALID [2022-04-27 10:52:17,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret1 := main(); {118#true} is VALID [2022-04-27 10:52:17,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~x~0 := 0;~y~0 := 50; {123#(= main_~x~0 0)} is VALID [2022-04-27 10:52:17,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= main_~x~0 0)} assume !(~x~0 < 100); {119#false} is VALID [2022-04-27 10:52:17,293 INFO L272 TraceCheckUtils]: 7: Hoare triple {119#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {119#false} is VALID [2022-04-27 10:52:17,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {119#false} ~cond := #in~cond; {119#false} is VALID [2022-04-27 10:52:17,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} assume 0 == ~cond; {119#false} is VALID [2022-04-27 10:52:17,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 10:52:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98771650] [2022-04-27 10:52:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98771650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:52:17,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:52:17,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:52:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817845919] [2022-04-27 10:52:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:52:17,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:52:17,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:17,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:52:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:52:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:52:17,310 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,383 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 10:52:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:52:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:52:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:52:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:52:17,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 10:52:17,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,413 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:52:17,414 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:52:17,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:52:17,418 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:17,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:52:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:52:17,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:17,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,424 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,424 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,425 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:52:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:52:17,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:52:17,427 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:52:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,427 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:52:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:52:17,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:17,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 10:52:17,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 10:52:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:17,431 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 10:52:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:52:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:52:17,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:17,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:52:17,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 85580979, now seen corresponding path program 1 times [2022-04-27 10:52:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:17,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605149248] [2022-04-27 10:52:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {215#true} is VALID [2022-04-27 10:52:17,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 10:52:17,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #56#return; {215#true} is VALID [2022-04-27 10:52:17,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:17,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {215#true} is VALID [2022-04-27 10:52:17,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 10:52:17,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #56#return; {215#true} is VALID [2022-04-27 10:52:17,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret1 := main(); {215#true} is VALID [2022-04-27 10:52:17,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0;~y~0 := 50; {220#(= main_~x~0 0)} is VALID [2022-04-27 10:52:17,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~x~0 0)} assume !!(~x~0 < 100); {220#(= main_~x~0 0)} is VALID [2022-04-27 10:52:17,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {221#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:17,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(<= main_~x~0 1)} assume !(~x~0 < 100); {216#false} is VALID [2022-04-27 10:52:17,503 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {216#false} is VALID [2022-04-27 10:52:17,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 10:52:17,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 10:52:17,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 10:52:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:17,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605149248] [2022-04-27 10:52:17,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605149248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:17,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599379520] [2022-04-27 10:52:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:17,506 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) [2022-04-27 10:52:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:52:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:52:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:17,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:17,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2022-04-27 10:52:17,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {215#true} is VALID [2022-04-27 10:52:17,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 10:52:17,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #56#return; {215#true} is VALID [2022-04-27 10:52:17,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret1 := main(); {215#true} is VALID [2022-04-27 10:52:17,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0;~y~0 := 50; {241#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:17,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(<= main_~x~0 0)} assume !!(~x~0 < 100); {241#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:17,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {221#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:17,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(<= main_~x~0 1)} assume !(~x~0 < 100); {216#false} is VALID [2022-04-27 10:52:17,662 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {216#false} is VALID [2022-04-27 10:52:17,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 10:52:17,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 10:52:17,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 10:52:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:17,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:17,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 10:52:17,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-04-27 10:52:17,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-04-27 10:52:17,728 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {216#false} is VALID [2022-04-27 10:52:17,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(< main_~x~0 100)} assume !(~x~0 < 100); {216#false} is VALID [2022-04-27 10:52:17,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(< main_~x~0 99)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {275#(< main_~x~0 100)} is VALID [2022-04-27 10:52:17,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#(< main_~x~0 99)} assume !!(~x~0 < 100); {279#(< main_~x~0 99)} is VALID [2022-04-27 10:52:17,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} ~x~0 := 0;~y~0 := 50; {279#(< main_~x~0 99)} is VALID [2022-04-27 10:52:17,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret1 := main(); {215#true} is VALID [2022-04-27 10:52:17,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #56#return; {215#true} is VALID [2022-04-27 10:52:17,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 10:52:17,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {215#true} is VALID [2022-04-27 10:52:17,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2022-04-27 10:52:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:17,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599379520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:17,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:17,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:52:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76170904] [2022-04-27 10:52:17,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:52:17,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:17,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:52:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:52:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:52:17,751 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,865 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-04-27 10:52:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:52:17,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:52:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-27 10:52:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-27 10:52:17,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-27 10:52:17,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:17,891 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:52:17,891 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:52:17,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:52:17,892 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:17,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:52:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 10:52:17,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:17,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,897 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,897 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,898 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:52:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:52:17,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 10:52:17,898 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 10:52:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:17,899 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:52:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:52:17,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:17,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:17,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:17,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 10:52:17,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2022-04-27 10:52:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:17,901 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 10:52:17,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:52:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:52:17,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:17,902 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:17,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:18,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:18,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -942830074, now seen corresponding path program 1 times [2022-04-27 10:52:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24512170] [2022-04-27 10:52:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {423#true} is VALID [2022-04-27 10:52:18,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-27 10:52:18,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #56#return; {423#true} is VALID [2022-04-27 10:52:18,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:18,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {423#true} is VALID [2022-04-27 10:52:18,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-27 10:52:18,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #56#return; {423#true} is VALID [2022-04-27 10:52:18,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret1 := main(); {423#true} is VALID [2022-04-27 10:52:18,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~x~0 := 0;~y~0 := 50; {428#(= main_~x~0 0)} is VALID [2022-04-27 10:52:18,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~x~0 0)} assume !!(~x~0 < 100); {428#(= main_~x~0 0)} is VALID [2022-04-27 10:52:18,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {429#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~x~0 1)} assume !!(~x~0 < 100); {429#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {430#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {430#(<= main_~x~0 2)} assume !!(~x~0 < 100); {430#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#(<= main_~x~0 2)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#false} assume !!(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume !(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,195 INFO L272 TraceCheckUtils]: 15: Hoare triple {424#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {424#false} is VALID [2022-04-27 10:52:18,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-27 10:52:18,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-27 10:52:18,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-27 10:52:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:18,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24512170] [2022-04-27 10:52:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24512170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518527232] [2022-04-27 10:52:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:18,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:18,200 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) [2022-04-27 10:52:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:52:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:52:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:18,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-27 10:52:18,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {423#true} is VALID [2022-04-27 10:52:18,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-27 10:52:18,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #56#return; {423#true} is VALID [2022-04-27 10:52:18,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret1 := main(); {423#true} is VALID [2022-04-27 10:52:18,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~x~0 := 0;~y~0 := 50; {450#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:18,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#(<= main_~x~0 0)} assume !!(~x~0 < 100); {450#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:18,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {429#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(<= main_~x~0 1)} assume !!(~x~0 < 100); {429#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {430#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {430#(<= main_~x~0 2)} assume !!(~x~0 < 100); {430#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#(<= main_~x~0 2)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#false} assume !!(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume !(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,332 INFO L272 TraceCheckUtils]: 15: Hoare triple {424#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {424#false} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-27 10:52:18,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-27 10:52:18,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-27 10:52:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:18,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:18,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-27 10:52:18,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-27 10:52:18,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-27 10:52:18,454 INFO L272 TraceCheckUtils]: 15: Hoare triple {424#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {424#false} is VALID [2022-04-27 10:52:18,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume !(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {424#false} assume !!(~x~0 < 100); {424#false} is VALID [2022-04-27 10:52:18,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#(< main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {424#false} is VALID [2022-04-27 10:52:18,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(< main_~x~0 50)} assume !!(~x~0 < 100); {511#(< main_~x~0 50)} is VALID [2022-04-27 10:52:18,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#(< main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {511#(< main_~x~0 50)} is VALID [2022-04-27 10:52:18,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#(< main_~x~0 49)} assume !!(~x~0 < 100); {518#(< main_~x~0 49)} is VALID [2022-04-27 10:52:18,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {525#(< main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {518#(< main_~x~0 49)} is VALID [2022-04-27 10:52:18,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {525#(< main_~x~0 48)} assume !!(~x~0 < 100); {525#(< main_~x~0 48)} is VALID [2022-04-27 10:52:18,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} ~x~0 := 0;~y~0 := 50; {525#(< main_~x~0 48)} is VALID [2022-04-27 10:52:18,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret1 := main(); {423#true} is VALID [2022-04-27 10:52:18,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #56#return; {423#true} is VALID [2022-04-27 10:52:18,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-27 10:52:18,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {423#true} is VALID [2022-04-27 10:52:18,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-27 10:52:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:18,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518527232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:18,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:18,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 10:52:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354238523] [2022-04-27 10:52:18,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:52:18,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:18,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:18,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:52:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:52:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:52:18,503 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:18,633 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-27 10:52:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:52:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:52:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 10:52:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 10:52:18,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-27 10:52:18,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:18,664 INFO L225 Difference]: With dead ends: 38 [2022-04-27 10:52:18,664 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 10:52:18,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:52:18,665 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:18,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:52:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 10:52:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 10:52:18,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:18,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,675 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,675 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:18,676 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:52:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:52:18,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:18,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:18,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 10:52:18,677 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 10:52:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:18,679 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:52:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:52:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:18,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:18,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:18,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-27 10:52:18,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2022-04-27 10:52:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:18,684 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-27 10:52:18,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:52:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:52:18,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:18,685 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:18,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:52:18,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1651209990, now seen corresponding path program 2 times [2022-04-27 10:52:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:18,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006645472] [2022-04-27 10:52:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:18,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {718#true} is VALID [2022-04-27 10:52:18,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#true} assume true; {718#true} is VALID [2022-04-27 10:52:18,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718#true} {718#true} #56#return; {718#true} is VALID [2022-04-27 10:52:18,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:18,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {718#true} is VALID [2022-04-27 10:52:18,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2022-04-27 10:52:18,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #56#return; {718#true} is VALID [2022-04-27 10:52:18,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret1 := main(); {718#true} is VALID [2022-04-27 10:52:18,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {718#true} ~x~0 := 0;~y~0 := 50; {723#(= main_~x~0 0)} is VALID [2022-04-27 10:52:18,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {723#(= main_~x~0 0)} assume !!(~x~0 < 100); {723#(= main_~x~0 0)} is VALID [2022-04-27 10:52:18,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {723#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {724#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(<= main_~x~0 1)} assume !!(~x~0 < 100); {724#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:18,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {725#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {725#(<= main_~x~0 2)} assume !!(~x~0 < 100); {725#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:18,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {725#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {726#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:18,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#(<= main_~x~0 3)} assume !!(~x~0 < 100); {726#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:18,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {726#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {727#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:18,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(<= main_~x~0 4)} assume !!(~x~0 < 100); {727#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:18,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {728#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:18,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {728#(<= main_~x~0 5)} assume !!(~x~0 < 100); {728#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:18,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {729#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:18,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {729#(<= main_~x~0 6)} assume !!(~x~0 < 100); {729#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {729#(<= main_~x~0 6)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#false} assume !!(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#false} assume !(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,003 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {719#false} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2022-04-27 10:52:19,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2022-04-27 10:52:19,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {719#false} assume !false; {719#false} is VALID [2022-04-27 10:52:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:19,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006645472] [2022-04-27 10:52:19,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006645472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:19,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545057744] [2022-04-27 10:52:19,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:52:19,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:19,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:19,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:52:19,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:52:19,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:19,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:52:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:19,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2022-04-27 10:52:19,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {718#true} is VALID [2022-04-27 10:52:19,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2022-04-27 10:52:19,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #56#return; {718#true} is VALID [2022-04-27 10:52:19,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret1 := main(); {718#true} is VALID [2022-04-27 10:52:19,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {718#true} ~x~0 := 0;~y~0 := 50; {749#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:19,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {749#(<= main_~x~0 0)} assume !!(~x~0 < 100); {749#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:19,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {724#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:19,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(<= main_~x~0 1)} assume !!(~x~0 < 100); {724#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:19,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {725#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:19,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {725#(<= main_~x~0 2)} assume !!(~x~0 < 100); {725#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:19,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {725#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {726#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:19,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#(<= main_~x~0 3)} assume !!(~x~0 < 100); {726#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:19,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {726#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {727#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:19,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(<= main_~x~0 4)} assume !!(~x~0 < 100); {727#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:19,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {728#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:19,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {728#(<= main_~x~0 5)} assume !!(~x~0 < 100); {728#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:19,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {729#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:19,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {729#(<= main_~x~0 6)} assume !!(~x~0 < 100); {729#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:19,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {729#(<= main_~x~0 6)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#false} assume !!(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#false} assume !(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,175 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {719#false} is VALID [2022-04-27 10:52:19,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2022-04-27 10:52:19,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2022-04-27 10:52:19,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {719#false} assume !false; {719#false} is VALID [2022-04-27 10:52:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:19,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:19,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {719#false} assume !false; {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2022-04-27 10:52:19,379 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#false} assume !(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#false} assume !!(~x~0 < 100); {719#false} is VALID [2022-04-27 10:52:19,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(< main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {719#false} is VALID [2022-04-27 10:52:19,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {834#(< main_~x~0 50)} assume !!(~x~0 < 100); {834#(< main_~x~0 50)} is VALID [2022-04-27 10:52:19,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#(< main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {834#(< main_~x~0 50)} is VALID [2022-04-27 10:52:19,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#(< main_~x~0 49)} assume !!(~x~0 < 100); {841#(< main_~x~0 49)} is VALID [2022-04-27 10:52:19,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {848#(< main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {841#(< main_~x~0 49)} is VALID [2022-04-27 10:52:19,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {848#(< main_~x~0 48)} assume !!(~x~0 < 100); {848#(< main_~x~0 48)} is VALID [2022-04-27 10:52:19,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {855#(< main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {848#(< main_~x~0 48)} is VALID [2022-04-27 10:52:19,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< main_~x~0 47)} assume !!(~x~0 < 100); {855#(< main_~x~0 47)} is VALID [2022-04-27 10:52:19,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {862#(< main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {855#(< main_~x~0 47)} is VALID [2022-04-27 10:52:19,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {862#(< main_~x~0 46)} assume !!(~x~0 < 100); {862#(< main_~x~0 46)} is VALID [2022-04-27 10:52:19,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {869#(< main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {862#(< main_~x~0 46)} is VALID [2022-04-27 10:52:19,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(< main_~x~0 45)} assume !!(~x~0 < 100); {869#(< main_~x~0 45)} is VALID [2022-04-27 10:52:19,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(< main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {869#(< main_~x~0 45)} is VALID [2022-04-27 10:52:19,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {876#(< main_~x~0 44)} assume !!(~x~0 < 100); {876#(< main_~x~0 44)} is VALID [2022-04-27 10:52:19,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {718#true} ~x~0 := 0;~y~0 := 50; {876#(< main_~x~0 44)} is VALID [2022-04-27 10:52:19,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret1 := main(); {718#true} is VALID [2022-04-27 10:52:19,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #56#return; {718#true} is VALID [2022-04-27 10:52:19,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2022-04-27 10:52:19,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {718#true} is VALID [2022-04-27 10:52:19,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2022-04-27 10:52:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:19,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545057744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:19,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:19,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-27 10:52:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110025816] [2022-04-27 10:52:19,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 10:52:19,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:19,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:19,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:52:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:52:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:52:19,425 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:19,747 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 10:52:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:52:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 10:52:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-27 10:52:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-27 10:52:19,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 58 transitions. [2022-04-27 10:52:19,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:19,794 INFO L225 Difference]: With dead ends: 54 [2022-04-27 10:52:19,794 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 10:52:19,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:52:19,795 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:19,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 10:52:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 10:52:19,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:19,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,815 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,816 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:19,817 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-27 10:52:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:52:19,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:19,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:19,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 10:52:19,817 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-27 10:52:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:19,818 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-27 10:52:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:52:19,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:19,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:19,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:19,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-27 10:52:19,822 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2022-04-27 10:52:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:19,822 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-27 10:52:19,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-27 10:52:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:52:19,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:19,823 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:19,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:20,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1049238814, now seen corresponding path program 3 times [2022-04-27 10:52:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:20,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970899851] [2022-04-27 10:52:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:20,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1165#true} is VALID [2022-04-27 10:52:20,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:52:20,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1165#true} {1165#true} #56#return; {1165#true} is VALID [2022-04-27 10:52:20,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:20,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1165#true} is VALID [2022-04-27 10:52:20,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:52:20,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #56#return; {1165#true} is VALID [2022-04-27 10:52:20,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret1 := main(); {1165#true} is VALID [2022-04-27 10:52:20,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} ~x~0 := 0;~y~0 := 50; {1170#(= main_~x~0 0)} is VALID [2022-04-27 10:52:20,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {1170#(= main_~x~0 0)} assume !!(~x~0 < 100); {1170#(= main_~x~0 0)} is VALID [2022-04-27 10:52:20,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {1170#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1171#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:20,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {1171#(<= main_~x~0 1)} assume !!(~x~0 < 100); {1171#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:20,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1171#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1172#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:20,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(<= main_~x~0 2)} assume !!(~x~0 < 100); {1172#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:20,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1173#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:20,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#(<= main_~x~0 3)} assume !!(~x~0 < 100); {1173#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:20,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {1173#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1174#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:20,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#(<= main_~x~0 4)} assume !!(~x~0 < 100); {1174#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:20,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1175#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:20,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#(<= main_~x~0 5)} assume !!(~x~0 < 100); {1175#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:20,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {1175#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1176#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:20,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#(<= main_~x~0 6)} assume !!(~x~0 < 100); {1176#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:20,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1176#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1177#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:20,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1177#(<= main_~x~0 7)} assume !!(~x~0 < 100); {1177#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:20,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1177#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1178#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:20,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(<= main_~x~0 8)} assume !!(~x~0 < 100); {1178#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:20,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1179#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:20,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {1179#(<= main_~x~0 9)} assume !!(~x~0 < 100); {1179#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:20,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1180#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:20,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {1180#(<= main_~x~0 10)} assume !!(~x~0 < 100); {1180#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:20,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {1180#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1181#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:20,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {1181#(<= main_~x~0 11)} assume !!(~x~0 < 100); {1181#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:20,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {1181#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1182#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:20,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {1182#(<= main_~x~0 12)} assume !!(~x~0 < 100); {1182#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:20,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {1182#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1183#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:20,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1183#(<= main_~x~0 13)} assume !!(~x~0 < 100); {1183#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:20,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {1183#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1184#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {1184#(<= main_~x~0 14)} assume !!(~x~0 < 100); {1184#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {1184#(<= main_~x~0 14)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1166#false} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {1166#false} assume !!(~x~0 < 100); {1166#false} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {1166#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1166#false} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {1166#false} assume !(~x~0 < 100); {1166#false} is VALID [2022-04-27 10:52:20,244 INFO L272 TraceCheckUtils]: 39: Hoare triple {1166#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1166#false} is VALID [2022-04-27 10:52:20,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {1166#false} ~cond := #in~cond; {1166#false} is VALID [2022-04-27 10:52:20,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {1166#false} assume 0 == ~cond; {1166#false} is VALID [2022-04-27 10:52:20,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 10:52:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:52:20,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:20,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970899851] [2022-04-27 10:52:20,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970899851] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:20,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651890817] [2022-04-27 10:52:20,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:52:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:20,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:20,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:52:20,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 10:52:20,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:20,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:52:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:20,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:20,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #56#return; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret1 := main(); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} ~x~0 := 0;~y~0 := 50; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1288#(< main_~x~0 51)} is VALID [2022-04-27 10:52:20,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {1288#(< main_~x~0 51)} assume !!(~x~0 < 100); {1288#(< main_~x~0 51)} is VALID [2022-04-27 10:52:20,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {1288#(< main_~x~0 51)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1295#(< main_~x~0 52)} is VALID [2022-04-27 10:52:20,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {1295#(< main_~x~0 52)} assume !!(~x~0 < 100); {1295#(< main_~x~0 52)} is VALID [2022-04-27 10:52:20,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {1295#(< main_~x~0 52)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1302#(< main_~x~0 53)} is VALID [2022-04-27 10:52:20,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {1302#(< main_~x~0 53)} assume !(~x~0 < 100); {1166#false} is VALID [2022-04-27 10:52:20,467 INFO L272 TraceCheckUtils]: 39: Hoare triple {1166#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1166#false} is VALID [2022-04-27 10:52:20,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {1166#false} ~cond := #in~cond; {1166#false} is VALID [2022-04-27 10:52:20,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {1166#false} assume 0 == ~cond; {1166#false} is VALID [2022-04-27 10:52:20,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 10:52:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-27 10:52:20,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:20,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 10:52:20,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {1166#false} assume 0 == ~cond; {1166#false} is VALID [2022-04-27 10:52:20,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {1166#false} ~cond := #in~cond; {1166#false} is VALID [2022-04-27 10:52:20,636 INFO L272 TraceCheckUtils]: 39: Hoare triple {1166#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1166#false} is VALID [2022-04-27 10:52:20,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {1330#(< main_~x~0 100)} assume !(~x~0 < 100); {1166#false} is VALID [2022-04-27 10:52:20,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {1334#(< main_~x~0 99)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1330#(< main_~x~0 100)} is VALID [2022-04-27 10:52:20,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {1334#(< main_~x~0 99)} assume !!(~x~0 < 100); {1334#(< main_~x~0 99)} is VALID [2022-04-27 10:52:20,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {1341#(< main_~x~0 98)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1334#(< main_~x~0 99)} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {1341#(< main_~x~0 98)} assume !!(~x~0 < 100); {1341#(< main_~x~0 98)} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1341#(< main_~x~0 98)} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1165#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#true} assume !!(~x~0 < 100); {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} ~x~0 := 0;~y~0 := 50; {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret1 := main(); {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #56#return; {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1165#true} is VALID [2022-04-27 10:52:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-27 10:52:20,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651890817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:20,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:20,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5, 5] total 24 [2022-04-27 10:52:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674956874] [2022-04-27 10:52:20,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:52:20,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:20,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:20,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 10:52:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 10:52:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:52:20,681 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:21,113 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 10:52:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 10:52:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:52:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-27 10:52:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-27 10:52:21,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 73 transitions. [2022-04-27 10:52:21,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:21,181 INFO L225 Difference]: With dead ends: 64 [2022-04-27 10:52:21,181 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 10:52:21,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 10:52:21,183 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:21,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 23 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 10:52:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 10:52:21,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:21,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,211 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,212 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:21,214 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 10:52:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 10:52:21,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:21,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:21,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 10:52:21,220 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 10:52:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:21,222 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-27 10:52:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 10:52:21,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:21,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:21,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:21,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 10:52:21,224 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2022-04-27 10:52:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:21,224 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 10:52:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 10:52:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 10:52:21,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:21,227 INFO L195 NwaCegarLoop]: trace histogram [21, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:21,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 10:52:21,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:21,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1735632235, now seen corresponding path program 4 times [2022-04-27 10:52:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:21,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943398578] [2022-04-27 10:52:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:21,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {1804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1783#true} {1783#true} #56#return; {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:21,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #56#return; {1783#true} is VALID [2022-04-27 10:52:21,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret1 := main(); {1783#true} is VALID [2022-04-27 10:52:21,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := 50; {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:52:21,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {1788#(= main_~x~0 0)} assume !!(~x~0 < 100); {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:52:21,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1789#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:21,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1789#(<= main_~x~0 1)} assume !!(~x~0 < 100); {1789#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:21,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1790#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:21,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(<= main_~x~0 2)} assume !!(~x~0 < 100); {1790#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:21,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1791#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:21,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(<= main_~x~0 3)} assume !!(~x~0 < 100); {1791#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:21,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {1791#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1792#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:21,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#(<= main_~x~0 4)} assume !!(~x~0 < 100); {1792#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:21,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1793#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:21,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#(<= main_~x~0 5)} assume !!(~x~0 < 100); {1793#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:21,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1794#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:21,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {1794#(<= main_~x~0 6)} assume !!(~x~0 < 100); {1794#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:21,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1795#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:21,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(<= main_~x~0 7)} assume !!(~x~0 < 100); {1795#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:21,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {1795#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1796#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:21,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {1796#(<= main_~x~0 8)} assume !!(~x~0 < 100); {1796#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:21,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1797#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:21,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#(<= main_~x~0 9)} assume !!(~x~0 < 100); {1797#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:21,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1798#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:21,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {1798#(<= main_~x~0 10)} assume !!(~x~0 < 100); {1798#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:21,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {1798#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1799#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:21,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {1799#(<= main_~x~0 11)} assume !!(~x~0 < 100); {1799#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:21,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {1799#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1800#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:21,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {1800#(<= main_~x~0 12)} assume !!(~x~0 < 100); {1800#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:21,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {1800#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1801#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:21,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {1801#(<= main_~x~0 13)} assume !!(~x~0 < 100); {1801#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:21,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {1801#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1802#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:21,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {1802#(<= main_~x~0 14)} assume !!(~x~0 < 100); {1802#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:21,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {1802#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1803#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {1803#(<= main_~x~0 15)} assume !!(~x~0 < 100); {1803#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {1803#(<= main_~x~0 15)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {1784#false} assume !(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,651 INFO L272 TraceCheckUtils]: 49: Hoare triple {1784#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1784#false} is VALID [2022-04-27 10:52:21,651 INFO L290 TraceCheckUtils]: 50: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:52:21,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:52:21,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:52:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:21,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943398578] [2022-04-27 10:52:21,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943398578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:21,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011733560] [2022-04-27 10:52:21,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:52:21,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:21,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:21,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:52:21,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:52:21,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:21,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 10:52:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:21,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:21,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2022-04-27 10:52:21,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1783#true} is VALID [2022-04-27 10:52:21,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:52:21,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #56#return; {1783#true} is VALID [2022-04-27 10:52:21,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret1 := main(); {1783#true} is VALID [2022-04-27 10:52:21,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := 50; {1823#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:21,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {1823#(<= main_~x~0 0)} assume !!(~x~0 < 100); {1823#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:21,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1823#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1789#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:21,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {1789#(<= main_~x~0 1)} assume !!(~x~0 < 100); {1789#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:21,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1790#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:21,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(<= main_~x~0 2)} assume !!(~x~0 < 100); {1790#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:21,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1791#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:21,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(<= main_~x~0 3)} assume !!(~x~0 < 100); {1791#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:21,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1791#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1792#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:21,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#(<= main_~x~0 4)} assume !!(~x~0 < 100); {1792#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:21,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1793#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:21,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#(<= main_~x~0 5)} assume !!(~x~0 < 100); {1793#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:21,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1794#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:21,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {1794#(<= main_~x~0 6)} assume !!(~x~0 < 100); {1794#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:21,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1795#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:21,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(<= main_~x~0 7)} assume !!(~x~0 < 100); {1795#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:21,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {1795#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1796#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:21,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {1796#(<= main_~x~0 8)} assume !!(~x~0 < 100); {1796#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:21,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1797#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:21,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#(<= main_~x~0 9)} assume !!(~x~0 < 100); {1797#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:21,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1798#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:21,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {1798#(<= main_~x~0 10)} assume !!(~x~0 < 100); {1798#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:21,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {1798#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1799#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:21,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {1799#(<= main_~x~0 11)} assume !!(~x~0 < 100); {1799#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:21,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {1799#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1800#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:21,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {1800#(<= main_~x~0 12)} assume !!(~x~0 < 100); {1800#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:21,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {1800#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1801#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:21,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {1801#(<= main_~x~0 13)} assume !!(~x~0 < 100); {1801#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:21,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {1801#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1802#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:21,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {1802#(<= main_~x~0 14)} assume !!(~x~0 < 100); {1802#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {1802#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {1803#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {1803#(<= main_~x~0 15)} assume !!(~x~0 < 100); {1803#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {1803#(<= main_~x~0 15)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {1784#false} assume !(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L272 TraceCheckUtils]: 49: Hoare triple {1784#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:52:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:21,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L272 TraceCheckUtils]: 49: Hoare triple {1784#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {1784#false} assume !(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {1784#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {1784#false} assume !!(~x~0 < 100); {1784#false} is VALID [2022-04-27 10:52:22,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {2010#(< main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {1784#false} is VALID [2022-04-27 10:52:22,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {2010#(< main_~x~0 50)} assume !!(~x~0 < 100); {2010#(< main_~x~0 50)} is VALID [2022-04-27 10:52:22,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#(< main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2010#(< main_~x~0 50)} is VALID [2022-04-27 10:52:22,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#(< main_~x~0 49)} assume !!(~x~0 < 100); {2017#(< main_~x~0 49)} is VALID [2022-04-27 10:52:22,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {2024#(< main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2017#(< main_~x~0 49)} is VALID [2022-04-27 10:52:22,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {2024#(< main_~x~0 48)} assume !!(~x~0 < 100); {2024#(< main_~x~0 48)} is VALID [2022-04-27 10:52:22,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {2031#(< main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2024#(< main_~x~0 48)} is VALID [2022-04-27 10:52:22,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {2031#(< main_~x~0 47)} assume !!(~x~0 < 100); {2031#(< main_~x~0 47)} is VALID [2022-04-27 10:52:22,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {2038#(< main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2031#(< main_~x~0 47)} is VALID [2022-04-27 10:52:22,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {2038#(< main_~x~0 46)} assume !!(~x~0 < 100); {2038#(< main_~x~0 46)} is VALID [2022-04-27 10:52:22,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {2045#(< main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2038#(< main_~x~0 46)} is VALID [2022-04-27 10:52:22,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {2045#(< main_~x~0 45)} assume !!(~x~0 < 100); {2045#(< main_~x~0 45)} is VALID [2022-04-27 10:52:22,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {2052#(< main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2045#(< main_~x~0 45)} is VALID [2022-04-27 10:52:22,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {2052#(< main_~x~0 44)} assume !!(~x~0 < 100); {2052#(< main_~x~0 44)} is VALID [2022-04-27 10:52:22,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {2059#(< main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2052#(< main_~x~0 44)} is VALID [2022-04-27 10:52:22,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {2059#(< main_~x~0 43)} assume !!(~x~0 < 100); {2059#(< main_~x~0 43)} is VALID [2022-04-27 10:52:22,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {2066#(< main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2059#(< main_~x~0 43)} is VALID [2022-04-27 10:52:22,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {2066#(< main_~x~0 42)} assume !!(~x~0 < 100); {2066#(< main_~x~0 42)} is VALID [2022-04-27 10:52:22,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {2073#(< main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2066#(< main_~x~0 42)} is VALID [2022-04-27 10:52:22,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {2073#(< main_~x~0 41)} assume !!(~x~0 < 100); {2073#(< main_~x~0 41)} is VALID [2022-04-27 10:52:22,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {2080#(< main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2073#(< main_~x~0 41)} is VALID [2022-04-27 10:52:22,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {2080#(< main_~x~0 40)} assume !!(~x~0 < 100); {2080#(< main_~x~0 40)} is VALID [2022-04-27 10:52:22,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {2087#(< main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2080#(< main_~x~0 40)} is VALID [2022-04-27 10:52:22,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {2087#(< main_~x~0 39)} assume !!(~x~0 < 100); {2087#(< main_~x~0 39)} is VALID [2022-04-27 10:52:22,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#(< main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2087#(< main_~x~0 39)} is VALID [2022-04-27 10:52:22,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#(< main_~x~0 38)} assume !!(~x~0 < 100); {2094#(< main_~x~0 38)} is VALID [2022-04-27 10:52:22,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {2101#(< main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2094#(< main_~x~0 38)} is VALID [2022-04-27 10:52:22,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {2101#(< main_~x~0 37)} assume !!(~x~0 < 100); {2101#(< main_~x~0 37)} is VALID [2022-04-27 10:52:22,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {2108#(< main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2101#(< main_~x~0 37)} is VALID [2022-04-27 10:52:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2108#(< main_~x~0 36)} assume !!(~x~0 < 100); {2108#(< main_~x~0 36)} is VALID [2022-04-27 10:52:22,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {2115#(< main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2108#(< main_~x~0 36)} is VALID [2022-04-27 10:52:22,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {2115#(< main_~x~0 35)} assume !!(~x~0 < 100); {2115#(< main_~x~0 35)} is VALID [2022-04-27 10:52:22,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := 50; {2115#(< main_~x~0 35)} is VALID [2022-04-27 10:52:22,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret1 := main(); {1783#true} is VALID [2022-04-27 10:52:22,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #56#return; {1783#true} is VALID [2022-04-27 10:52:22,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:52:22,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1783#true} is VALID [2022-04-27 10:52:22,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2022-04-27 10:52:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:22,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011733560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:22,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:22,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-27 10:52:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795619945] [2022-04-27 10:52:22,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 10:52:22,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:22,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:22,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:22,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 10:52:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 10:52:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 10:52:22,539 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:23,259 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-27 10:52:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-27 10:52:23,259 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 10:52:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 103 transitions. [2022-04-27 10:52:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 103 transitions. [2022-04-27 10:52:23,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 103 transitions. [2022-04-27 10:52:23,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:23,345 INFO L225 Difference]: With dead ends: 106 [2022-04-27 10:52:23,345 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 10:52:23,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2022-04-27 10:52:23,347 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:23,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 10:52:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 10:52:23,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:23,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,394 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,394 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:23,396 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-27 10:52:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-27 10:52:23,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:23,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:23,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 10:52:23,397 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 10:52:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:23,398 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-27 10:52:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-27 10:52:23,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:23,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:23,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:23,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-04-27 10:52:23,401 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 53 [2022-04-27 10:52:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:23,401 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-04-27 10:52:23,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-27 10:52:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 10:52:23,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:23,402 INFO L195 NwaCegarLoop]: trace histogram [38, 32, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:23,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:23,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:23,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1520903576, now seen corresponding path program 5 times [2022-04-27 10:52:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:23,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637099110] [2022-04-27 10:52:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:23,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:24,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {2710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2672#true} is VALID [2022-04-27 10:52:24,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 10:52:24,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #56#return; {2672#true} is VALID [2022-04-27 10:52:24,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:24,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {2710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2672#true} is VALID [2022-04-27 10:52:24,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 10:52:24,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #56#return; {2672#true} is VALID [2022-04-27 10:52:24,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret1 := main(); {2672#true} is VALID [2022-04-27 10:52:24,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} ~x~0 := 0;~y~0 := 50; {2677#(= main_~x~0 0)} is VALID [2022-04-27 10:52:24,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {2677#(= main_~x~0 0)} assume !!(~x~0 < 100); {2677#(= main_~x~0 0)} is VALID [2022-04-27 10:52:24,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {2677#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2678#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:24,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~x~0 1)} assume !!(~x~0 < 100); {2678#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:24,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2679#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:24,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {2679#(<= main_~x~0 2)} assume !!(~x~0 < 100); {2679#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:24,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {2679#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2680#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:24,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(<= main_~x~0 3)} assume !!(~x~0 < 100); {2680#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:24,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {2680#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2681#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:24,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#(<= main_~x~0 4)} assume !!(~x~0 < 100); {2681#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:24,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {2681#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2682#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:24,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= main_~x~0 5)} assume !!(~x~0 < 100); {2682#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:24,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {2682#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2683#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:24,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {2683#(<= main_~x~0 6)} assume !!(~x~0 < 100); {2683#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:24,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {2683#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2684#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:24,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {2684#(<= main_~x~0 7)} assume !!(~x~0 < 100); {2684#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:24,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {2684#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2685#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:24,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {2685#(<= main_~x~0 8)} assume !!(~x~0 < 100); {2685#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:24,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {2685#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2686#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:24,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {2686#(<= main_~x~0 9)} assume !!(~x~0 < 100); {2686#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:24,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {2686#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2687#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:24,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {2687#(<= main_~x~0 10)} assume !!(~x~0 < 100); {2687#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:24,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {2687#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2688#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:24,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {2688#(<= main_~x~0 11)} assume !!(~x~0 < 100); {2688#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:24,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {2688#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2689#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:24,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#(<= main_~x~0 12)} assume !!(~x~0 < 100); {2689#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:24,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2690#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:24,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {2690#(<= main_~x~0 13)} assume !!(~x~0 < 100); {2690#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:24,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {2690#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2691#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:24,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {2691#(<= main_~x~0 14)} assume !!(~x~0 < 100); {2691#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:24,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {2691#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2692#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:24,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {2692#(<= main_~x~0 15)} assume !!(~x~0 < 100); {2692#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:24,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {2692#(<= main_~x~0 15)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2693#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:24,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {2693#(<= main_~x~0 16)} assume !!(~x~0 < 100); {2693#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:24,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {2693#(<= main_~x~0 16)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:24,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {2694#(<= main_~x~0 17)} assume !!(~x~0 < 100); {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:24,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {2694#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:24,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {2695#(<= main_~x~0 18)} assume !!(~x~0 < 100); {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:24,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {2695#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:24,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {2696#(<= main_~x~0 19)} assume !!(~x~0 < 100); {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:24,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {2696#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:24,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {2697#(<= main_~x~0 20)} assume !!(~x~0 < 100); {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:24,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {2697#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:24,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {2698#(<= main_~x~0 21)} assume !!(~x~0 < 100); {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:24,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {2698#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:24,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {2699#(<= main_~x~0 22)} assume !!(~x~0 < 100); {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:24,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {2699#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:24,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {2700#(<= main_~x~0 23)} assume !!(~x~0 < 100); {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:24,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {2700#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:24,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {2701#(<= main_~x~0 24)} assume !!(~x~0 < 100); {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:24,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {2701#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:24,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {2702#(<= main_~x~0 25)} assume !!(~x~0 < 100); {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:24,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {2702#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:24,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {2703#(<= main_~x~0 26)} assume !!(~x~0 < 100); {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:24,154 INFO L290 TraceCheckUtils]: 59: Hoare triple {2703#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:24,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {2704#(<= main_~x~0 27)} assume !!(~x~0 < 100); {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:24,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {2704#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:24,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {2705#(<= main_~x~0 28)} assume !!(~x~0 < 100); {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:24,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {2705#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:24,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {2706#(<= main_~x~0 29)} assume !!(~x~0 < 100); {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:24,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {2706#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:24,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {2707#(<= main_~x~0 30)} assume !!(~x~0 < 100); {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:24,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {2707#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:24,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {2708#(<= main_~x~0 31)} assume !!(~x~0 < 100); {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:24,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {2708#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {2709#(<= main_~x~0 32)} assume !!(~x~0 < 100); {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {2709#(<= main_~x~0 32)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 72: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 73: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {2673#false} assume !(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L272 TraceCheckUtils]: 83: Hoare triple {2673#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 10:52:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637099110] [2022-04-27 10:52:24,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637099110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:24,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895419551] [2022-04-27 10:52:24,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:52:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:24,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:24,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 10:52:24,239 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2022-04-27 10:52:24,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:24,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 10:52:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:24,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:24,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 10:52:24,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2672#true} is VALID [2022-04-27 10:52:24,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 10:52:24,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #56#return; {2672#true} is VALID [2022-04-27 10:52:24,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret1 := main(); {2672#true} is VALID [2022-04-27 10:52:24,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} ~x~0 := 0;~y~0 := 50; {2729#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:24,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {2729#(<= main_~x~0 0)} assume !!(~x~0 < 100); {2729#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:24,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {2729#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2678#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:24,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~x~0 1)} assume !!(~x~0 < 100); {2678#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:24,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2679#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:24,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {2679#(<= main_~x~0 2)} assume !!(~x~0 < 100); {2679#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:24,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {2679#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2680#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:24,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(<= main_~x~0 3)} assume !!(~x~0 < 100); {2680#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:24,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {2680#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2681#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:24,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#(<= main_~x~0 4)} assume !!(~x~0 < 100); {2681#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:24,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {2681#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2682#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:24,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= main_~x~0 5)} assume !!(~x~0 < 100); {2682#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:24,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {2682#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2683#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:24,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {2683#(<= main_~x~0 6)} assume !!(~x~0 < 100); {2683#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:24,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {2683#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2684#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:24,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {2684#(<= main_~x~0 7)} assume !!(~x~0 < 100); {2684#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:24,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {2684#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2685#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:24,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {2685#(<= main_~x~0 8)} assume !!(~x~0 < 100); {2685#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:24,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {2685#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2686#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:24,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {2686#(<= main_~x~0 9)} assume !!(~x~0 < 100); {2686#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:24,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {2686#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2687#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:24,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {2687#(<= main_~x~0 10)} assume !!(~x~0 < 100); {2687#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:24,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2687#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2688#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:24,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2688#(<= main_~x~0 11)} assume !!(~x~0 < 100); {2688#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:24,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {2688#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2689#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:24,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#(<= main_~x~0 12)} assume !!(~x~0 < 100); {2689#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:24,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2690#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:24,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {2690#(<= main_~x~0 13)} assume !!(~x~0 < 100); {2690#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:24,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {2690#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2691#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:24,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {2691#(<= main_~x~0 14)} assume !!(~x~0 < 100); {2691#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:24,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {2691#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2692#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:24,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {2692#(<= main_~x~0 15)} assume !!(~x~0 < 100); {2692#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:24,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {2692#(<= main_~x~0 15)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2693#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:24,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {2693#(<= main_~x~0 16)} assume !!(~x~0 < 100); {2693#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:24,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {2693#(<= main_~x~0 16)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:24,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {2694#(<= main_~x~0 17)} assume !!(~x~0 < 100); {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:24,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {2694#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:24,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {2695#(<= main_~x~0 18)} assume !!(~x~0 < 100); {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:24,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {2695#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:24,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {2696#(<= main_~x~0 19)} assume !!(~x~0 < 100); {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:24,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {2696#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:24,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {2697#(<= main_~x~0 20)} assume !!(~x~0 < 100); {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:24,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {2697#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:24,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {2698#(<= main_~x~0 21)} assume !!(~x~0 < 100); {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:24,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {2698#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:24,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {2699#(<= main_~x~0 22)} assume !!(~x~0 < 100); {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:24,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {2699#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:24,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {2700#(<= main_~x~0 23)} assume !!(~x~0 < 100); {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:24,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {2700#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:24,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {2701#(<= main_~x~0 24)} assume !!(~x~0 < 100); {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:24,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {2701#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:24,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {2702#(<= main_~x~0 25)} assume !!(~x~0 < 100); {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:24,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {2702#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:24,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {2703#(<= main_~x~0 26)} assume !!(~x~0 < 100); {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:24,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {2703#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:24,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {2704#(<= main_~x~0 27)} assume !!(~x~0 < 100); {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:24,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {2704#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:24,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {2705#(<= main_~x~0 28)} assume !!(~x~0 < 100); {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:24,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {2705#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:24,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {2706#(<= main_~x~0 29)} assume !!(~x~0 < 100); {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:24,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {2706#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:24,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {2707#(<= main_~x~0 30)} assume !!(~x~0 < 100); {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:24,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {2707#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:24,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {2708#(<= main_~x~0 31)} assume !!(~x~0 < 100); {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {2708#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {2709#(<= main_~x~0 32)} assume !!(~x~0 < 100); {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {2709#(<= main_~x~0 32)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 79: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 80: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {2673#false} assume !(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L272 TraceCheckUtils]: 83: Hoare triple {2673#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 85: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 10:52:24,779 INFO L290 TraceCheckUtils]: 86: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 10:52:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:24,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 86: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L272 TraceCheckUtils]: 83: Hoare triple {2673#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {2673#false} assume !(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 75: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {2673#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {2673#false} assume !!(~x~0 < 100); {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {3018#(< main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {2673#false} is VALID [2022-04-27 10:52:25,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {3018#(< main_~x~0 50)} assume !!(~x~0 < 100); {3018#(< main_~x~0 50)} is VALID [2022-04-27 10:52:25,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {3025#(< main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3018#(< main_~x~0 50)} is VALID [2022-04-27 10:52:25,739 INFO L290 TraceCheckUtils]: 68: Hoare triple {3025#(< main_~x~0 49)} assume !!(~x~0 < 100); {3025#(< main_~x~0 49)} is VALID [2022-04-27 10:52:25,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {3032#(< main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3025#(< main_~x~0 49)} is VALID [2022-04-27 10:52:25,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {3032#(< main_~x~0 48)} assume !!(~x~0 < 100); {3032#(< main_~x~0 48)} is VALID [2022-04-27 10:52:25,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {3039#(< main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3032#(< main_~x~0 48)} is VALID [2022-04-27 10:52:25,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {3039#(< main_~x~0 47)} assume !!(~x~0 < 100); {3039#(< main_~x~0 47)} is VALID [2022-04-27 10:52:25,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {3046#(< main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3039#(< main_~x~0 47)} is VALID [2022-04-27 10:52:25,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {3046#(< main_~x~0 46)} assume !!(~x~0 < 100); {3046#(< main_~x~0 46)} is VALID [2022-04-27 10:52:25,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {3053#(< main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3046#(< main_~x~0 46)} is VALID [2022-04-27 10:52:25,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {3053#(< main_~x~0 45)} assume !!(~x~0 < 100); {3053#(< main_~x~0 45)} is VALID [2022-04-27 10:52:25,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {3060#(< main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3053#(< main_~x~0 45)} is VALID [2022-04-27 10:52:25,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {3060#(< main_~x~0 44)} assume !!(~x~0 < 100); {3060#(< main_~x~0 44)} is VALID [2022-04-27 10:52:25,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {3067#(< main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3060#(< main_~x~0 44)} is VALID [2022-04-27 10:52:25,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {3067#(< main_~x~0 43)} assume !!(~x~0 < 100); {3067#(< main_~x~0 43)} is VALID [2022-04-27 10:52:25,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {3074#(< main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3067#(< main_~x~0 43)} is VALID [2022-04-27 10:52:25,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {3074#(< main_~x~0 42)} assume !!(~x~0 < 100); {3074#(< main_~x~0 42)} is VALID [2022-04-27 10:52:25,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {3081#(< main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3074#(< main_~x~0 42)} is VALID [2022-04-27 10:52:25,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {3081#(< main_~x~0 41)} assume !!(~x~0 < 100); {3081#(< main_~x~0 41)} is VALID [2022-04-27 10:52:25,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {3088#(< main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3081#(< main_~x~0 41)} is VALID [2022-04-27 10:52:25,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {3088#(< main_~x~0 40)} assume !!(~x~0 < 100); {3088#(< main_~x~0 40)} is VALID [2022-04-27 10:52:25,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {3095#(< main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3088#(< main_~x~0 40)} is VALID [2022-04-27 10:52:25,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {3095#(< main_~x~0 39)} assume !!(~x~0 < 100); {3095#(< main_~x~0 39)} is VALID [2022-04-27 10:52:25,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {3102#(< main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3095#(< main_~x~0 39)} is VALID [2022-04-27 10:52:25,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {3102#(< main_~x~0 38)} assume !!(~x~0 < 100); {3102#(< main_~x~0 38)} is VALID [2022-04-27 10:52:25,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {3109#(< main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3102#(< main_~x~0 38)} is VALID [2022-04-27 10:52:25,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {3109#(< main_~x~0 37)} assume !!(~x~0 < 100); {3109#(< main_~x~0 37)} is VALID [2022-04-27 10:52:25,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {3116#(< main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3109#(< main_~x~0 37)} is VALID [2022-04-27 10:52:25,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {3116#(< main_~x~0 36)} assume !!(~x~0 < 100); {3116#(< main_~x~0 36)} is VALID [2022-04-27 10:52:25,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {3123#(< main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3116#(< main_~x~0 36)} is VALID [2022-04-27 10:52:25,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {3123#(< main_~x~0 35)} assume !!(~x~0 < 100); {3123#(< main_~x~0 35)} is VALID [2022-04-27 10:52:25,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#(< main_~x~0 34)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3123#(< main_~x~0 35)} is VALID [2022-04-27 10:52:25,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#(< main_~x~0 34)} assume !!(~x~0 < 100); {3130#(< main_~x~0 34)} is VALID [2022-04-27 10:52:25,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {2709#(<= main_~x~0 32)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3130#(< main_~x~0 34)} is VALID [2022-04-27 10:52:25,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {2709#(<= main_~x~0 32)} assume !!(~x~0 < 100); {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:25,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {2708#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2709#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:25,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(<= main_~x~0 31)} assume !!(~x~0 < 100); {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:25,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {2707#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2708#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:25,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {2707#(<= main_~x~0 30)} assume !!(~x~0 < 100); {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:25,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {2706#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2707#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:25,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {2706#(<= main_~x~0 29)} assume !!(~x~0 < 100); {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:25,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {2705#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2706#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:25,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {2705#(<= main_~x~0 28)} assume !!(~x~0 < 100); {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:25,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {2704#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2705#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:25,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {2704#(<= main_~x~0 27)} assume !!(~x~0 < 100); {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:25,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {2703#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2704#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:25,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#(<= main_~x~0 26)} assume !!(~x~0 < 100); {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:25,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {2702#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2703#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:25,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {2702#(<= main_~x~0 25)} assume !!(~x~0 < 100); {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:25,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {2701#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2702#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:25,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {2701#(<= main_~x~0 24)} assume !!(~x~0 < 100); {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:25,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {2700#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2701#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:25,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {2700#(<= main_~x~0 23)} assume !!(~x~0 < 100); {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:25,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {2699#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2700#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:25,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {2699#(<= main_~x~0 22)} assume !!(~x~0 < 100); {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:25,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {2698#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2699#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:25,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {2698#(<= main_~x~0 21)} assume !!(~x~0 < 100); {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:25,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {2697#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2698#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:25,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#(<= main_~x~0 20)} assume !!(~x~0 < 100); {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:25,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2697#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:25,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {2696#(<= main_~x~0 19)} assume !!(~x~0 < 100); {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:25,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {2695#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2696#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:25,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {2695#(<= main_~x~0 18)} assume !!(~x~0 < 100); {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:25,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {2694#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {2695#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:25,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {2694#(<= main_~x~0 17)} assume !!(~x~0 < 100); {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:25,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} ~x~0 := 0;~y~0 := 50; {2694#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:25,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret1 := main(); {2672#true} is VALID [2022-04-27 10:52:25,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #56#return; {2672#true} is VALID [2022-04-27 10:52:25,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 10:52:25,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2672#true} is VALID [2022-04-27 10:52:25,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 10:52:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:52:25,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895419551] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:25,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:25,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 54 [2022-04-27 10:52:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584804459] [2022-04-27 10:52:25,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 10:52:25,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:25,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:25,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:25,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-27 10:52:25,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-27 10:52:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-27 10:52:25,838 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:27,116 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2022-04-27 10:52:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-27 10:52:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-27 10:52:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 140 transitions. [2022-04-27 10:52:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 140 transitions. [2022-04-27 10:52:27,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 140 transitions. [2022-04-27 10:52:27,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:27,243 INFO L225 Difference]: With dead ends: 142 [2022-04-27 10:52:27,243 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 10:52:27,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2022-04-27 10:52:27,246 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:27,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 39 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:52:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 10:52:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-27 10:52:27,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:27,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,317 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,317 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:27,319 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-27 10:52:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-27 10:52:27,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:27,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:27,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 10:52:27,320 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 10:52:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:27,322 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-27 10:52:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-27 10:52:27,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:27,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:27,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:27,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0588235294117647) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2022-04-27 10:52:27,325 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 87 [2022-04-27 10:52:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:27,325 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2022-04-27 10:52:27,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.1296296296296298) internal successors, (115), 53 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-27 10:52:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-27 10:52:27,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:27,326 INFO L195 NwaCegarLoop]: trace histogram [56, 50, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:27,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:27,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:27,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -133828510, now seen corresponding path program 6 times [2022-04-27 10:52:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:27,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771501832] [2022-04-27 10:52:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:28,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {4061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3999#true} is VALID [2022-04-27 10:52:28,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-27 10:52:28,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3999#true} {3999#true} #56#return; {3999#true} is VALID [2022-04-27 10:52:28,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {4061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:28,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {4061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3999#true} is VALID [2022-04-27 10:52:28,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-27 10:52:28,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #56#return; {3999#true} is VALID [2022-04-27 10:52:28,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret1 := main(); {3999#true} is VALID [2022-04-27 10:52:28,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {3999#true} ~x~0 := 0;~y~0 := 50; {4004#(= main_~x~0 0)} is VALID [2022-04-27 10:52:28,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {4004#(= main_~x~0 0)} assume !!(~x~0 < 100); {4004#(= main_~x~0 0)} is VALID [2022-04-27 10:52:28,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {4004#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4005#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:28,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= main_~x~0 1)} assume !!(~x~0 < 100); {4005#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:28,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4006#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:28,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {4006#(<= main_~x~0 2)} assume !!(~x~0 < 100); {4006#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:28,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {4006#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4007#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:28,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {4007#(<= main_~x~0 3)} assume !!(~x~0 < 100); {4007#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:28,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {4007#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4008#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:28,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {4008#(<= main_~x~0 4)} assume !!(~x~0 < 100); {4008#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:28,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {4008#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4009#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:28,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {4009#(<= main_~x~0 5)} assume !!(~x~0 < 100); {4009#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:28,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {4009#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4010#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:28,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {4010#(<= main_~x~0 6)} assume !!(~x~0 < 100); {4010#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:28,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {4010#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4011#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:28,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {4011#(<= main_~x~0 7)} assume !!(~x~0 < 100); {4011#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:28,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4012#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:28,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {4012#(<= main_~x~0 8)} assume !!(~x~0 < 100); {4012#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:28,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {4012#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4013#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:28,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {4013#(<= main_~x~0 9)} assume !!(~x~0 < 100); {4013#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:28,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {4013#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4014#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:28,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {4014#(<= main_~x~0 10)} assume !!(~x~0 < 100); {4014#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:28,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {4014#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4015#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:28,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {4015#(<= main_~x~0 11)} assume !!(~x~0 < 100); {4015#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:28,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {4015#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4016#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:28,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#(<= main_~x~0 12)} assume !!(~x~0 < 100); {4016#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:28,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4017#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:28,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {4017#(<= main_~x~0 13)} assume !!(~x~0 < 100); {4017#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:28,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {4017#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4018#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:28,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {4018#(<= main_~x~0 14)} assume !!(~x~0 < 100); {4018#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:28,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {4018#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4019#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:28,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {4019#(<= main_~x~0 15)} assume !!(~x~0 < 100); {4019#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:28,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {4019#(<= main_~x~0 15)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4020#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:28,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {4020#(<= main_~x~0 16)} assume !!(~x~0 < 100); {4020#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:28,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {4020#(<= main_~x~0 16)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4021#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:28,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {4021#(<= main_~x~0 17)} assume !!(~x~0 < 100); {4021#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:28,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {4021#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4022#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:28,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {4022#(<= main_~x~0 18)} assume !!(~x~0 < 100); {4022#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:28,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {4022#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4023#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:28,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {4023#(<= main_~x~0 19)} assume !!(~x~0 < 100); {4023#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:28,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {4023#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4024#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:28,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {4024#(<= main_~x~0 20)} assume !!(~x~0 < 100); {4024#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:28,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {4024#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4025#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:28,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {4025#(<= main_~x~0 21)} assume !!(~x~0 < 100); {4025#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:28,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {4025#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4026#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:28,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {4026#(<= main_~x~0 22)} assume !!(~x~0 < 100); {4026#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:28,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {4026#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4027#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:28,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {4027#(<= main_~x~0 23)} assume !!(~x~0 < 100); {4027#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:28,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {4027#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4028#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:28,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {4028#(<= main_~x~0 24)} assume !!(~x~0 < 100); {4028#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:28,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {4028#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4029#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:28,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {4029#(<= main_~x~0 25)} assume !!(~x~0 < 100); {4029#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:28,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {4029#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4030#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:28,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {4030#(<= main_~x~0 26)} assume !!(~x~0 < 100); {4030#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:28,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {4030#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4031#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:28,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {4031#(<= main_~x~0 27)} assume !!(~x~0 < 100); {4031#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:28,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {4031#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4032#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:28,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {4032#(<= main_~x~0 28)} assume !!(~x~0 < 100); {4032#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:28,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {4032#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4033#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:28,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {4033#(<= main_~x~0 29)} assume !!(~x~0 < 100); {4033#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:28,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {4033#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4034#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:28,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {4034#(<= main_~x~0 30)} assume !!(~x~0 < 100); {4034#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:28,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {4034#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4035#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:28,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {4035#(<= main_~x~0 31)} assume !!(~x~0 < 100); {4035#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:28,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {4035#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4036#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:28,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {4036#(<= main_~x~0 32)} assume !!(~x~0 < 100); {4036#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:28,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {4036#(<= main_~x~0 32)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4037#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:28,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {4037#(<= main_~x~0 33)} assume !!(~x~0 < 100); {4037#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:28,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {4037#(<= main_~x~0 33)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4038#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:28,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {4038#(<= main_~x~0 34)} assume !!(~x~0 < 100); {4038#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:28,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {4038#(<= main_~x~0 34)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4039#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:28,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {4039#(<= main_~x~0 35)} assume !!(~x~0 < 100); {4039#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:28,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {4039#(<= main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4040#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:28,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {4040#(<= main_~x~0 36)} assume !!(~x~0 < 100); {4040#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:28,700 INFO L290 TraceCheckUtils]: 79: Hoare triple {4040#(<= main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4041#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:28,700 INFO L290 TraceCheckUtils]: 80: Hoare triple {4041#(<= main_~x~0 37)} assume !!(~x~0 < 100); {4041#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:28,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {4041#(<= main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4042#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:28,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {4042#(<= main_~x~0 38)} assume !!(~x~0 < 100); {4042#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:28,701 INFO L290 TraceCheckUtils]: 83: Hoare triple {4042#(<= main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4043#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:28,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {4043#(<= main_~x~0 39)} assume !!(~x~0 < 100); {4043#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:28,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {4043#(<= main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4044#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:28,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {4044#(<= main_~x~0 40)} assume !!(~x~0 < 100); {4044#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:28,702 INFO L290 TraceCheckUtils]: 87: Hoare triple {4044#(<= main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4045#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:28,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {4045#(<= main_~x~0 41)} assume !!(~x~0 < 100); {4045#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:28,703 INFO L290 TraceCheckUtils]: 89: Hoare triple {4045#(<= main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4046#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:28,703 INFO L290 TraceCheckUtils]: 90: Hoare triple {4046#(<= main_~x~0 42)} assume !!(~x~0 < 100); {4046#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:28,704 INFO L290 TraceCheckUtils]: 91: Hoare triple {4046#(<= main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4047#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:28,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {4047#(<= main_~x~0 43)} assume !!(~x~0 < 100); {4047#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:28,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {4047#(<= main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4048#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:28,705 INFO L290 TraceCheckUtils]: 94: Hoare triple {4048#(<= main_~x~0 44)} assume !!(~x~0 < 100); {4048#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:28,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {4048#(<= main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4049#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:28,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {4049#(<= main_~x~0 45)} assume !!(~x~0 < 100); {4049#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:28,706 INFO L290 TraceCheckUtils]: 97: Hoare triple {4049#(<= main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4050#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:28,706 INFO L290 TraceCheckUtils]: 98: Hoare triple {4050#(<= main_~x~0 46)} assume !!(~x~0 < 100); {4050#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:28,706 INFO L290 TraceCheckUtils]: 99: Hoare triple {4050#(<= main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4051#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:28,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {4051#(<= main_~x~0 47)} assume !!(~x~0 < 100); {4051#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:28,707 INFO L290 TraceCheckUtils]: 101: Hoare triple {4051#(<= main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4052#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:28,707 INFO L290 TraceCheckUtils]: 102: Hoare triple {4052#(<= main_~x~0 48)} assume !!(~x~0 < 100); {4052#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:28,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {4052#(<= main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4053#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:28,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {4053#(<= main_~x~0 49)} assume !!(~x~0 < 100); {4053#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:28,708 INFO L290 TraceCheckUtils]: 105: Hoare triple {4053#(<= main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4054#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:28,708 INFO L290 TraceCheckUtils]: 106: Hoare triple {4054#(<= main_~x~0 50)} assume !!(~x~0 < 100); {4054#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:28,709 INFO L290 TraceCheckUtils]: 107: Hoare triple {4054#(<= main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4055#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:28,709 INFO L290 TraceCheckUtils]: 108: Hoare triple {4055#(<= main_~x~0 51)} assume !!(~x~0 < 100); {4055#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:28,709 INFO L290 TraceCheckUtils]: 109: Hoare triple {4055#(<= main_~x~0 51)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4056#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:28,710 INFO L290 TraceCheckUtils]: 110: Hoare triple {4056#(<= main_~x~0 52)} assume !!(~x~0 < 100); {4056#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:28,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {4056#(<= main_~x~0 52)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4057#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:28,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {4057#(<= main_~x~0 53)} assume !!(~x~0 < 100); {4057#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:28,711 INFO L290 TraceCheckUtils]: 113: Hoare triple {4057#(<= main_~x~0 53)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4058#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:28,711 INFO L290 TraceCheckUtils]: 114: Hoare triple {4058#(<= main_~x~0 54)} assume !!(~x~0 < 100); {4058#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:28,711 INFO L290 TraceCheckUtils]: 115: Hoare triple {4058#(<= main_~x~0 54)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4059#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:28,712 INFO L290 TraceCheckUtils]: 116: Hoare triple {4059#(<= main_~x~0 55)} assume !!(~x~0 < 100); {4059#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:28,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {4059#(<= main_~x~0 55)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4060#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:28,712 INFO L290 TraceCheckUtils]: 118: Hoare triple {4060#(<= main_~x~0 56)} assume !(~x~0 < 100); {4000#false} is VALID [2022-04-27 10:52:28,712 INFO L272 TraceCheckUtils]: 119: Hoare triple {4000#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4000#false} is VALID [2022-04-27 10:52:28,712 INFO L290 TraceCheckUtils]: 120: Hoare triple {4000#false} ~cond := #in~cond; {4000#false} is VALID [2022-04-27 10:52:28,713 INFO L290 TraceCheckUtils]: 121: Hoare triple {4000#false} assume 0 == ~cond; {4000#false} is VALID [2022-04-27 10:52:28,713 INFO L290 TraceCheckUtils]: 122: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2022-04-27 10:52:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:28,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771501832] [2022-04-27 10:52:28,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771501832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:28,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894238232] [2022-04-27 10:52:28,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:52:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:28,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:28,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:28,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 10:52:28,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-27 10:52:28,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:28,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:52:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:28,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:29,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #56#return; {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret1 := main(); {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3999#true} ~x~0 := 0;~y~0 := 50; {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 55: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 56: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 79: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 80: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 81: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 87: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 88: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 89: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 95: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4054#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:29,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {4054#(<= main_~x~0 50)} assume !!(~x~0 < 100); {4054#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:29,103 INFO L290 TraceCheckUtils]: 107: Hoare triple {4054#(<= main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4055#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:29,103 INFO L290 TraceCheckUtils]: 108: Hoare triple {4055#(<= main_~x~0 51)} assume !!(~x~0 < 100); {4055#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:29,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {4055#(<= main_~x~0 51)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4056#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:29,104 INFO L290 TraceCheckUtils]: 110: Hoare triple {4056#(<= main_~x~0 52)} assume !!(~x~0 < 100); {4056#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:29,104 INFO L290 TraceCheckUtils]: 111: Hoare triple {4056#(<= main_~x~0 52)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4057#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:29,105 INFO L290 TraceCheckUtils]: 112: Hoare triple {4057#(<= main_~x~0 53)} assume !!(~x~0 < 100); {4057#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:29,105 INFO L290 TraceCheckUtils]: 113: Hoare triple {4057#(<= main_~x~0 53)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4058#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:29,105 INFO L290 TraceCheckUtils]: 114: Hoare triple {4058#(<= main_~x~0 54)} assume !!(~x~0 < 100); {4058#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:29,106 INFO L290 TraceCheckUtils]: 115: Hoare triple {4058#(<= main_~x~0 54)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4059#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:29,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {4059#(<= main_~x~0 55)} assume !!(~x~0 < 100); {4059#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:29,106 INFO L290 TraceCheckUtils]: 117: Hoare triple {4059#(<= main_~x~0 55)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4060#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:29,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {4060#(<= main_~x~0 56)} assume !(~x~0 < 100); {4000#false} is VALID [2022-04-27 10:52:29,107 INFO L272 TraceCheckUtils]: 119: Hoare triple {4000#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4000#false} is VALID [2022-04-27 10:52:29,107 INFO L290 TraceCheckUtils]: 120: Hoare triple {4000#false} ~cond := #in~cond; {4000#false} is VALID [2022-04-27 10:52:29,107 INFO L290 TraceCheckUtils]: 121: Hoare triple {4000#false} assume 0 == ~cond; {4000#false} is VALID [2022-04-27 10:52:29,107 INFO L290 TraceCheckUtils]: 122: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2022-04-27 10:52:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2022-04-27 10:52:29,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:29,612 INFO L290 TraceCheckUtils]: 122: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2022-04-27 10:52:29,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {4000#false} assume 0 == ~cond; {4000#false} is VALID [2022-04-27 10:52:29,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {4000#false} ~cond := #in~cond; {4000#false} is VALID [2022-04-27 10:52:29,612 INFO L272 TraceCheckUtils]: 119: Hoare triple {4000#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {4000#false} is VALID [2022-04-27 10:52:29,613 INFO L290 TraceCheckUtils]: 118: Hoare triple {4443#(< main_~x~0 100)} assume !(~x~0 < 100); {4000#false} is VALID [2022-04-27 10:52:29,613 INFO L290 TraceCheckUtils]: 117: Hoare triple {4447#(< main_~x~0 99)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4443#(< main_~x~0 100)} is VALID [2022-04-27 10:52:29,613 INFO L290 TraceCheckUtils]: 116: Hoare triple {4447#(< main_~x~0 99)} assume !!(~x~0 < 100); {4447#(< main_~x~0 99)} is VALID [2022-04-27 10:52:29,614 INFO L290 TraceCheckUtils]: 115: Hoare triple {4454#(< main_~x~0 98)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4447#(< main_~x~0 99)} is VALID [2022-04-27 10:52:29,614 INFO L290 TraceCheckUtils]: 114: Hoare triple {4454#(< main_~x~0 98)} assume !!(~x~0 < 100); {4454#(< main_~x~0 98)} is VALID [2022-04-27 10:52:29,614 INFO L290 TraceCheckUtils]: 113: Hoare triple {4461#(< main_~x~0 97)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4454#(< main_~x~0 98)} is VALID [2022-04-27 10:52:29,615 INFO L290 TraceCheckUtils]: 112: Hoare triple {4461#(< main_~x~0 97)} assume !!(~x~0 < 100); {4461#(< main_~x~0 97)} is VALID [2022-04-27 10:52:29,615 INFO L290 TraceCheckUtils]: 111: Hoare triple {4468#(< main_~x~0 96)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4461#(< main_~x~0 97)} is VALID [2022-04-27 10:52:29,615 INFO L290 TraceCheckUtils]: 110: Hoare triple {4468#(< main_~x~0 96)} assume !!(~x~0 < 100); {4468#(< main_~x~0 96)} is VALID [2022-04-27 10:52:29,616 INFO L290 TraceCheckUtils]: 109: Hoare triple {4475#(< main_~x~0 95)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4468#(< main_~x~0 96)} is VALID [2022-04-27 10:52:29,616 INFO L290 TraceCheckUtils]: 108: Hoare triple {4475#(< main_~x~0 95)} assume !!(~x~0 < 100); {4475#(< main_~x~0 95)} is VALID [2022-04-27 10:52:29,616 INFO L290 TraceCheckUtils]: 107: Hoare triple {4482#(< main_~x~0 94)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {4475#(< main_~x~0 95)} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 106: Hoare triple {4482#(< main_~x~0 94)} assume !!(~x~0 < 100); {4482#(< main_~x~0 94)} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 105: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {4482#(< main_~x~0 94)} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 104: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 103: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 102: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 101: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 100: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 99: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 98: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 97: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 96: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 95: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 94: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 81: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 80: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 79: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 78: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 77: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 76: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 75: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 74: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {3999#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {3999#true} assume !!(~x~0 < 100); {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {3999#true} ~x~0 := 0;~y~0 := 50; {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret1 := main(); {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #56#return; {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3999#true} is VALID [2022-04-27 10:52:29,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2022-04-27 10:52:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2022-04-27 10:52:29,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894238232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:29,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:29,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 9, 9] total 67 [2022-04-27 10:52:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579889011] [2022-04-27 10:52:29,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-27 10:52:29,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:29,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:29,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:29,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-27 10:52:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-27 10:52:29,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2022-04-27 10:52:29,711 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:31,794 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2022-04-27 10:52:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-27 10:52:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-27 10:52:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 166 transitions. [2022-04-27 10:52:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 166 transitions. [2022-04-27 10:52:31,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 166 transitions. [2022-04-27 10:52:31,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:31,911 INFO L225 Difference]: With dead ends: 145 [2022-04-27 10:52:31,911 INFO L226 Difference]: Without dead ends: 140 [2022-04-27 10:52:31,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2022-04-27 10:52:31,914 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 134 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:31,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 43 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:52:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-27 10:52:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-27 10:52:32,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:32,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:32,011 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:32,012 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:32,014 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-04-27 10:52:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-04-27 10:52:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:32,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-27 10:52:32,015 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 140 states. [2022-04-27 10:52:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:32,017 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-04-27 10:52:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-04-27 10:52:32,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:32,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:32,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:32,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.1111111111111112) internal successors, (150), 135 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2022-04-27 10:52:32,026 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 123 [2022-04-27 10:52:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:32,026 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2022-04-27 10:52:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 66 states have internal predecessors, (138), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-04-27 10:52:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-27 10:52:32,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:32,028 INFO L195 NwaCegarLoop]: trace histogram [64, 50, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:32,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:32,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:32,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 327612986, now seen corresponding path program 7 times [2022-04-27 10:52:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734827202] [2022-04-27 10:52:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:33,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:33,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5656#true} assume true; {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5656#true} {5656#true} #56#return; {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {5656#true} call ULTIMATE.init(); {5726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:33,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {5656#true} assume true; {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5656#true} {5656#true} #56#return; {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {5656#true} call #t~ret1 := main(); {5656#true} is VALID [2022-04-27 10:52:33,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {5656#true} ~x~0 := 0;~y~0 := 50; {5661#(= main_~x~0 0)} is VALID [2022-04-27 10:52:33,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {5661#(= main_~x~0 0)} assume !!(~x~0 < 100); {5661#(= main_~x~0 0)} is VALID [2022-04-27 10:52:33,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5662#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:33,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {5662#(<= main_~x~0 1)} assume !!(~x~0 < 100); {5662#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:33,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {5662#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5663#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:33,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {5663#(<= main_~x~0 2)} assume !!(~x~0 < 100); {5663#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:33,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {5663#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5664#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:33,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {5664#(<= main_~x~0 3)} assume !!(~x~0 < 100); {5664#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:33,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {5664#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5665#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:33,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#(<= main_~x~0 4)} assume !!(~x~0 < 100); {5665#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:33,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5666#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:33,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {5666#(<= main_~x~0 5)} assume !!(~x~0 < 100); {5666#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:33,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {5666#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5667#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:33,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {5667#(<= main_~x~0 6)} assume !!(~x~0 < 100); {5667#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:33,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {5667#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5668#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:33,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {5668#(<= main_~x~0 7)} assume !!(~x~0 < 100); {5668#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:33,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {5668#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5669#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:33,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {5669#(<= main_~x~0 8)} assume !!(~x~0 < 100); {5669#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:33,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {5669#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5670#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:33,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {5670#(<= main_~x~0 9)} assume !!(~x~0 < 100); {5670#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:33,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {5670#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5671#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:33,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {5671#(<= main_~x~0 10)} assume !!(~x~0 < 100); {5671#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:33,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5672#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:33,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {5672#(<= main_~x~0 11)} assume !!(~x~0 < 100); {5672#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:33,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {5672#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5673#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:33,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {5673#(<= main_~x~0 12)} assume !!(~x~0 < 100); {5673#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:33,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {5673#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5674#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:33,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {5674#(<= main_~x~0 13)} assume !!(~x~0 < 100); {5674#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:33,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {5674#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5675#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:33,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#(<= main_~x~0 14)} assume !!(~x~0 < 100); {5675#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:33,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5676#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:33,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {5676#(<= main_~x~0 15)} assume !!(~x~0 < 100); {5676#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:33,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {5676#(<= main_~x~0 15)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5677#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:33,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {5677#(<= main_~x~0 16)} assume !!(~x~0 < 100); {5677#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:33,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {5677#(<= main_~x~0 16)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5678#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:33,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {5678#(<= main_~x~0 17)} assume !!(~x~0 < 100); {5678#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:33,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {5678#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5679#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:33,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {5679#(<= main_~x~0 18)} assume !!(~x~0 < 100); {5679#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:33,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {5679#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5680#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:33,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {5680#(<= main_~x~0 19)} assume !!(~x~0 < 100); {5680#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:33,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {5680#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5681#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:33,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {5681#(<= main_~x~0 20)} assume !!(~x~0 < 100); {5681#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:33,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {5681#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5682#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:33,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {5682#(<= main_~x~0 21)} assume !!(~x~0 < 100); {5682#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:33,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {5682#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5683#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:33,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {5683#(<= main_~x~0 22)} assume !!(~x~0 < 100); {5683#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:33,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {5683#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5684#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:33,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {5684#(<= main_~x~0 23)} assume !!(~x~0 < 100); {5684#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:33,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {5684#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5685#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:33,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {5685#(<= main_~x~0 24)} assume !!(~x~0 < 100); {5685#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:33,652 INFO L290 TraceCheckUtils]: 55: Hoare triple {5685#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5686#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:33,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {5686#(<= main_~x~0 25)} assume !!(~x~0 < 100); {5686#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:33,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {5686#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5687#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:33,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {5687#(<= main_~x~0 26)} assume !!(~x~0 < 100); {5687#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:33,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {5687#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5688#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:33,653 INFO L290 TraceCheckUtils]: 60: Hoare triple {5688#(<= main_~x~0 27)} assume !!(~x~0 < 100); {5688#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:33,653 INFO L290 TraceCheckUtils]: 61: Hoare triple {5688#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5689#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:33,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {5689#(<= main_~x~0 28)} assume !!(~x~0 < 100); {5689#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:33,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {5689#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5690#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:33,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {5690#(<= main_~x~0 29)} assume !!(~x~0 < 100); {5690#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:33,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {5690#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5691#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:33,655 INFO L290 TraceCheckUtils]: 66: Hoare triple {5691#(<= main_~x~0 30)} assume !!(~x~0 < 100); {5691#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:33,655 INFO L290 TraceCheckUtils]: 67: Hoare triple {5691#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5692#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:33,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {5692#(<= main_~x~0 31)} assume !!(~x~0 < 100); {5692#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:33,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {5692#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5693#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:33,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {5693#(<= main_~x~0 32)} assume !!(~x~0 < 100); {5693#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:33,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {5693#(<= main_~x~0 32)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5694#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:33,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {5694#(<= main_~x~0 33)} assume !!(~x~0 < 100); {5694#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:33,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {5694#(<= main_~x~0 33)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5695#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:33,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {5695#(<= main_~x~0 34)} assume !!(~x~0 < 100); {5695#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:33,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {5695#(<= main_~x~0 34)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:33,661 INFO L290 TraceCheckUtils]: 76: Hoare triple {5696#(<= main_~x~0 35)} assume !!(~x~0 < 100); {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:33,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {5696#(<= main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:33,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {5697#(<= main_~x~0 36)} assume !!(~x~0 < 100); {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:33,662 INFO L290 TraceCheckUtils]: 79: Hoare triple {5697#(<= main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:33,662 INFO L290 TraceCheckUtils]: 80: Hoare triple {5698#(<= main_~x~0 37)} assume !!(~x~0 < 100); {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:33,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {5698#(<= main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:33,663 INFO L290 TraceCheckUtils]: 82: Hoare triple {5699#(<= main_~x~0 38)} assume !!(~x~0 < 100); {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:33,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {5699#(<= main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:33,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {5700#(<= main_~x~0 39)} assume !!(~x~0 < 100); {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:33,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {5700#(<= main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:33,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {5701#(<= main_~x~0 40)} assume !!(~x~0 < 100); {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:33,664 INFO L290 TraceCheckUtils]: 87: Hoare triple {5701#(<= main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:33,664 INFO L290 TraceCheckUtils]: 88: Hoare triple {5702#(<= main_~x~0 41)} assume !!(~x~0 < 100); {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:33,665 INFO L290 TraceCheckUtils]: 89: Hoare triple {5702#(<= main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:33,665 INFO L290 TraceCheckUtils]: 90: Hoare triple {5703#(<= main_~x~0 42)} assume !!(~x~0 < 100); {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:33,665 INFO L290 TraceCheckUtils]: 91: Hoare triple {5703#(<= main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:33,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {5704#(<= main_~x~0 43)} assume !!(~x~0 < 100); {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:33,666 INFO L290 TraceCheckUtils]: 93: Hoare triple {5704#(<= main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:33,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {5705#(<= main_~x~0 44)} assume !!(~x~0 < 100); {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:33,666 INFO L290 TraceCheckUtils]: 95: Hoare triple {5705#(<= main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:33,667 INFO L290 TraceCheckUtils]: 96: Hoare triple {5706#(<= main_~x~0 45)} assume !!(~x~0 < 100); {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:33,667 INFO L290 TraceCheckUtils]: 97: Hoare triple {5706#(<= main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:33,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {5707#(<= main_~x~0 46)} assume !!(~x~0 < 100); {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:33,668 INFO L290 TraceCheckUtils]: 99: Hoare triple {5707#(<= main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:33,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {5708#(<= main_~x~0 47)} assume !!(~x~0 < 100); {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:33,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {5708#(<= main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:33,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {5709#(<= main_~x~0 48)} assume !!(~x~0 < 100); {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:33,669 INFO L290 TraceCheckUtils]: 103: Hoare triple {5709#(<= main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:33,669 INFO L290 TraceCheckUtils]: 104: Hoare triple {5710#(<= main_~x~0 49)} assume !!(~x~0 < 100); {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:33,669 INFO L290 TraceCheckUtils]: 105: Hoare triple {5710#(<= main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:33,670 INFO L290 TraceCheckUtils]: 106: Hoare triple {5711#(<= main_~x~0 50)} assume !!(~x~0 < 100); {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:33,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {5711#(<= main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:33,670 INFO L290 TraceCheckUtils]: 108: Hoare triple {5712#(<= main_~x~0 51)} assume !!(~x~0 < 100); {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:33,671 INFO L290 TraceCheckUtils]: 109: Hoare triple {5712#(<= main_~x~0 51)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:33,671 INFO L290 TraceCheckUtils]: 110: Hoare triple {5713#(<= main_~x~0 52)} assume !!(~x~0 < 100); {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:33,671 INFO L290 TraceCheckUtils]: 111: Hoare triple {5713#(<= main_~x~0 52)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:33,671 INFO L290 TraceCheckUtils]: 112: Hoare triple {5714#(<= main_~x~0 53)} assume !!(~x~0 < 100); {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:33,672 INFO L290 TraceCheckUtils]: 113: Hoare triple {5714#(<= main_~x~0 53)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:33,672 INFO L290 TraceCheckUtils]: 114: Hoare triple {5715#(<= main_~x~0 54)} assume !!(~x~0 < 100); {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:33,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {5715#(<= main_~x~0 54)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:33,673 INFO L290 TraceCheckUtils]: 116: Hoare triple {5716#(<= main_~x~0 55)} assume !!(~x~0 < 100); {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:33,673 INFO L290 TraceCheckUtils]: 117: Hoare triple {5716#(<= main_~x~0 55)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:33,673 INFO L290 TraceCheckUtils]: 118: Hoare triple {5717#(<= main_~x~0 56)} assume !!(~x~0 < 100); {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:33,674 INFO L290 TraceCheckUtils]: 119: Hoare triple {5717#(<= main_~x~0 56)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:33,674 INFO L290 TraceCheckUtils]: 120: Hoare triple {5718#(<= main_~x~0 57)} assume !!(~x~0 < 100); {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:33,674 INFO L290 TraceCheckUtils]: 121: Hoare triple {5718#(<= main_~x~0 57)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:33,674 INFO L290 TraceCheckUtils]: 122: Hoare triple {5719#(<= main_~x~0 58)} assume !!(~x~0 < 100); {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:33,675 INFO L290 TraceCheckUtils]: 123: Hoare triple {5719#(<= main_~x~0 58)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:33,675 INFO L290 TraceCheckUtils]: 124: Hoare triple {5720#(<= main_~x~0 59)} assume !!(~x~0 < 100); {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:33,675 INFO L290 TraceCheckUtils]: 125: Hoare triple {5720#(<= main_~x~0 59)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:33,676 INFO L290 TraceCheckUtils]: 126: Hoare triple {5721#(<= main_~x~0 60)} assume !!(~x~0 < 100); {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:33,676 INFO L290 TraceCheckUtils]: 127: Hoare triple {5721#(<= main_~x~0 60)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:33,676 INFO L290 TraceCheckUtils]: 128: Hoare triple {5722#(<= main_~x~0 61)} assume !!(~x~0 < 100); {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:33,677 INFO L290 TraceCheckUtils]: 129: Hoare triple {5722#(<= main_~x~0 61)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:33,677 INFO L290 TraceCheckUtils]: 130: Hoare triple {5723#(<= main_~x~0 62)} assume !!(~x~0 < 100); {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:33,677 INFO L290 TraceCheckUtils]: 131: Hoare triple {5723#(<= main_~x~0 62)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 132: Hoare triple {5724#(<= main_~x~0 63)} assume !!(~x~0 < 100); {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 133: Hoare triple {5724#(<= main_~x~0 63)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5725#(<= main_~x~0 64)} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 134: Hoare triple {5725#(<= main_~x~0 64)} assume !(~x~0 < 100); {5657#false} is VALID [2022-04-27 10:52:33,678 INFO L272 TraceCheckUtils]: 135: Hoare triple {5657#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5657#false} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 136: Hoare triple {5657#false} ~cond := #in~cond; {5657#false} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 137: Hoare triple {5657#false} assume 0 == ~cond; {5657#false} is VALID [2022-04-27 10:52:33,678 INFO L290 TraceCheckUtils]: 138: Hoare triple {5657#false} assume !false; {5657#false} is VALID [2022-04-27 10:52:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734827202] [2022-04-27 10:52:33,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734827202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231253340] [2022-04-27 10:52:33,680 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 10:52:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:33,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:33,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:52:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:33,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-27 10:52:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:33,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:34,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {5656#true} call ULTIMATE.init(); {5656#true} is VALID [2022-04-27 10:52:34,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {5656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5656#true} is VALID [2022-04-27 10:52:34,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {5656#true} assume true; {5656#true} is VALID [2022-04-27 10:52:34,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5656#true} {5656#true} #56#return; {5656#true} is VALID [2022-04-27 10:52:34,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {5656#true} call #t~ret1 := main(); {5656#true} is VALID [2022-04-27 10:52:34,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {5656#true} ~x~0 := 0;~y~0 := 50; {5745#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:34,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {5745#(<= main_~x~0 0)} assume !!(~x~0 < 100); {5745#(<= main_~x~0 0)} is VALID [2022-04-27 10:52:34,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {5745#(<= main_~x~0 0)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5662#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:34,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {5662#(<= main_~x~0 1)} assume !!(~x~0 < 100); {5662#(<= main_~x~0 1)} is VALID [2022-04-27 10:52:34,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {5662#(<= main_~x~0 1)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5663#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:34,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {5663#(<= main_~x~0 2)} assume !!(~x~0 < 100); {5663#(<= main_~x~0 2)} is VALID [2022-04-27 10:52:34,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {5663#(<= main_~x~0 2)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5664#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:34,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {5664#(<= main_~x~0 3)} assume !!(~x~0 < 100); {5664#(<= main_~x~0 3)} is VALID [2022-04-27 10:52:34,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5664#(<= main_~x~0 3)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5665#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:34,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#(<= main_~x~0 4)} assume !!(~x~0 < 100); {5665#(<= main_~x~0 4)} is VALID [2022-04-27 10:52:34,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {5665#(<= main_~x~0 4)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5666#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:34,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {5666#(<= main_~x~0 5)} assume !!(~x~0 < 100); {5666#(<= main_~x~0 5)} is VALID [2022-04-27 10:52:34,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {5666#(<= main_~x~0 5)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5667#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:34,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {5667#(<= main_~x~0 6)} assume !!(~x~0 < 100); {5667#(<= main_~x~0 6)} is VALID [2022-04-27 10:52:34,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {5667#(<= main_~x~0 6)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5668#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:34,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {5668#(<= main_~x~0 7)} assume !!(~x~0 < 100); {5668#(<= main_~x~0 7)} is VALID [2022-04-27 10:52:34,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {5668#(<= main_~x~0 7)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5669#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:34,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {5669#(<= main_~x~0 8)} assume !!(~x~0 < 100); {5669#(<= main_~x~0 8)} is VALID [2022-04-27 10:52:34,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {5669#(<= main_~x~0 8)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5670#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:34,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {5670#(<= main_~x~0 9)} assume !!(~x~0 < 100); {5670#(<= main_~x~0 9)} is VALID [2022-04-27 10:52:34,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {5670#(<= main_~x~0 9)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5671#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:34,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {5671#(<= main_~x~0 10)} assume !!(~x~0 < 100); {5671#(<= main_~x~0 10)} is VALID [2022-04-27 10:52:34,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(<= main_~x~0 10)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5672#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:34,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {5672#(<= main_~x~0 11)} assume !!(~x~0 < 100); {5672#(<= main_~x~0 11)} is VALID [2022-04-27 10:52:34,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {5672#(<= main_~x~0 11)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5673#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:34,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {5673#(<= main_~x~0 12)} assume !!(~x~0 < 100); {5673#(<= main_~x~0 12)} is VALID [2022-04-27 10:52:34,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {5673#(<= main_~x~0 12)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5674#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:34,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {5674#(<= main_~x~0 13)} assume !!(~x~0 < 100); {5674#(<= main_~x~0 13)} is VALID [2022-04-27 10:52:34,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {5674#(<= main_~x~0 13)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5675#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:34,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#(<= main_~x~0 14)} assume !!(~x~0 < 100); {5675#(<= main_~x~0 14)} is VALID [2022-04-27 10:52:34,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#(<= main_~x~0 14)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5676#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:34,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {5676#(<= main_~x~0 15)} assume !!(~x~0 < 100); {5676#(<= main_~x~0 15)} is VALID [2022-04-27 10:52:34,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {5676#(<= main_~x~0 15)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5677#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:34,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {5677#(<= main_~x~0 16)} assume !!(~x~0 < 100); {5677#(<= main_~x~0 16)} is VALID [2022-04-27 10:52:34,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {5677#(<= main_~x~0 16)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5678#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:34,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {5678#(<= main_~x~0 17)} assume !!(~x~0 < 100); {5678#(<= main_~x~0 17)} is VALID [2022-04-27 10:52:34,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {5678#(<= main_~x~0 17)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5679#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:34,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {5679#(<= main_~x~0 18)} assume !!(~x~0 < 100); {5679#(<= main_~x~0 18)} is VALID [2022-04-27 10:52:34,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {5679#(<= main_~x~0 18)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5680#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:34,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {5680#(<= main_~x~0 19)} assume !!(~x~0 < 100); {5680#(<= main_~x~0 19)} is VALID [2022-04-27 10:52:34,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {5680#(<= main_~x~0 19)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5681#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:34,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {5681#(<= main_~x~0 20)} assume !!(~x~0 < 100); {5681#(<= main_~x~0 20)} is VALID [2022-04-27 10:52:34,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {5681#(<= main_~x~0 20)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5682#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:34,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {5682#(<= main_~x~0 21)} assume !!(~x~0 < 100); {5682#(<= main_~x~0 21)} is VALID [2022-04-27 10:52:34,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {5682#(<= main_~x~0 21)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5683#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:34,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {5683#(<= main_~x~0 22)} assume !!(~x~0 < 100); {5683#(<= main_~x~0 22)} is VALID [2022-04-27 10:52:34,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {5683#(<= main_~x~0 22)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5684#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:34,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {5684#(<= main_~x~0 23)} assume !!(~x~0 < 100); {5684#(<= main_~x~0 23)} is VALID [2022-04-27 10:52:34,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {5684#(<= main_~x~0 23)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5685#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:34,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {5685#(<= main_~x~0 24)} assume !!(~x~0 < 100); {5685#(<= main_~x~0 24)} is VALID [2022-04-27 10:52:34,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {5685#(<= main_~x~0 24)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5686#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:34,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {5686#(<= main_~x~0 25)} assume !!(~x~0 < 100); {5686#(<= main_~x~0 25)} is VALID [2022-04-27 10:52:34,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {5686#(<= main_~x~0 25)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5687#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:34,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {5687#(<= main_~x~0 26)} assume !!(~x~0 < 100); {5687#(<= main_~x~0 26)} is VALID [2022-04-27 10:52:34,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {5687#(<= main_~x~0 26)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5688#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:34,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {5688#(<= main_~x~0 27)} assume !!(~x~0 < 100); {5688#(<= main_~x~0 27)} is VALID [2022-04-27 10:52:34,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {5688#(<= main_~x~0 27)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5689#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:34,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {5689#(<= main_~x~0 28)} assume !!(~x~0 < 100); {5689#(<= main_~x~0 28)} is VALID [2022-04-27 10:52:34,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {5689#(<= main_~x~0 28)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5690#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:34,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {5690#(<= main_~x~0 29)} assume !!(~x~0 < 100); {5690#(<= main_~x~0 29)} is VALID [2022-04-27 10:52:34,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {5690#(<= main_~x~0 29)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5691#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:34,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {5691#(<= main_~x~0 30)} assume !!(~x~0 < 100); {5691#(<= main_~x~0 30)} is VALID [2022-04-27 10:52:34,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {5691#(<= main_~x~0 30)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5692#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:34,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {5692#(<= main_~x~0 31)} assume !!(~x~0 < 100); {5692#(<= main_~x~0 31)} is VALID [2022-04-27 10:52:34,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {5692#(<= main_~x~0 31)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5693#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:34,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {5693#(<= main_~x~0 32)} assume !!(~x~0 < 100); {5693#(<= main_~x~0 32)} is VALID [2022-04-27 10:52:34,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {5693#(<= main_~x~0 32)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5694#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:34,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {5694#(<= main_~x~0 33)} assume !!(~x~0 < 100); {5694#(<= main_~x~0 33)} is VALID [2022-04-27 10:52:34,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {5694#(<= main_~x~0 33)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5695#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:34,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {5695#(<= main_~x~0 34)} assume !!(~x~0 < 100); {5695#(<= main_~x~0 34)} is VALID [2022-04-27 10:52:34,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {5695#(<= main_~x~0 34)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:34,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {5696#(<= main_~x~0 35)} assume !!(~x~0 < 100); {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:34,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {5696#(<= main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:34,626 INFO L290 TraceCheckUtils]: 78: Hoare triple {5697#(<= main_~x~0 36)} assume !!(~x~0 < 100); {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:34,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {5697#(<= main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:34,652 INFO L290 TraceCheckUtils]: 80: Hoare triple {5698#(<= main_~x~0 37)} assume !!(~x~0 < 100); {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:34,652 INFO L290 TraceCheckUtils]: 81: Hoare triple {5698#(<= main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:34,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {5699#(<= main_~x~0 38)} assume !!(~x~0 < 100); {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:34,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {5699#(<= main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:34,653 INFO L290 TraceCheckUtils]: 84: Hoare triple {5700#(<= main_~x~0 39)} assume !!(~x~0 < 100); {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:34,654 INFO L290 TraceCheckUtils]: 85: Hoare triple {5700#(<= main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:34,654 INFO L290 TraceCheckUtils]: 86: Hoare triple {5701#(<= main_~x~0 40)} assume !!(~x~0 < 100); {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:34,654 INFO L290 TraceCheckUtils]: 87: Hoare triple {5701#(<= main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:34,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {5702#(<= main_~x~0 41)} assume !!(~x~0 < 100); {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:34,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {5702#(<= main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:34,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {5703#(<= main_~x~0 42)} assume !!(~x~0 < 100); {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:34,656 INFO L290 TraceCheckUtils]: 91: Hoare triple {5703#(<= main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:34,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {5704#(<= main_~x~0 43)} assume !!(~x~0 < 100); {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:34,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {5704#(<= main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:34,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {5705#(<= main_~x~0 44)} assume !!(~x~0 < 100); {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:34,657 INFO L290 TraceCheckUtils]: 95: Hoare triple {5705#(<= main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:34,657 INFO L290 TraceCheckUtils]: 96: Hoare triple {5706#(<= main_~x~0 45)} assume !!(~x~0 < 100); {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:34,657 INFO L290 TraceCheckUtils]: 97: Hoare triple {5706#(<= main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:34,658 INFO L290 TraceCheckUtils]: 98: Hoare triple {5707#(<= main_~x~0 46)} assume !!(~x~0 < 100); {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:34,658 INFO L290 TraceCheckUtils]: 99: Hoare triple {5707#(<= main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:34,658 INFO L290 TraceCheckUtils]: 100: Hoare triple {5708#(<= main_~x~0 47)} assume !!(~x~0 < 100); {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:34,659 INFO L290 TraceCheckUtils]: 101: Hoare triple {5708#(<= main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:34,659 INFO L290 TraceCheckUtils]: 102: Hoare triple {5709#(<= main_~x~0 48)} assume !!(~x~0 < 100); {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:34,659 INFO L290 TraceCheckUtils]: 103: Hoare triple {5709#(<= main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:34,659 INFO L290 TraceCheckUtils]: 104: Hoare triple {5710#(<= main_~x~0 49)} assume !!(~x~0 < 100); {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:34,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {5710#(<= main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:34,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {5711#(<= main_~x~0 50)} assume !!(~x~0 < 100); {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:34,660 INFO L290 TraceCheckUtils]: 107: Hoare triple {5711#(<= main_~x~0 50)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:34,661 INFO L290 TraceCheckUtils]: 108: Hoare triple {5712#(<= main_~x~0 51)} assume !!(~x~0 < 100); {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:34,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {5712#(<= main_~x~0 51)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:34,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {5713#(<= main_~x~0 52)} assume !!(~x~0 < 100); {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:34,662 INFO L290 TraceCheckUtils]: 111: Hoare triple {5713#(<= main_~x~0 52)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:34,662 INFO L290 TraceCheckUtils]: 112: Hoare triple {5714#(<= main_~x~0 53)} assume !!(~x~0 < 100); {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:34,662 INFO L290 TraceCheckUtils]: 113: Hoare triple {5714#(<= main_~x~0 53)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:34,662 INFO L290 TraceCheckUtils]: 114: Hoare triple {5715#(<= main_~x~0 54)} assume !!(~x~0 < 100); {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:34,663 INFO L290 TraceCheckUtils]: 115: Hoare triple {5715#(<= main_~x~0 54)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:34,663 INFO L290 TraceCheckUtils]: 116: Hoare triple {5716#(<= main_~x~0 55)} assume !!(~x~0 < 100); {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:34,663 INFO L290 TraceCheckUtils]: 117: Hoare triple {5716#(<= main_~x~0 55)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:34,664 INFO L290 TraceCheckUtils]: 118: Hoare triple {5717#(<= main_~x~0 56)} assume !!(~x~0 < 100); {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:34,664 INFO L290 TraceCheckUtils]: 119: Hoare triple {5717#(<= main_~x~0 56)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:34,664 INFO L290 TraceCheckUtils]: 120: Hoare triple {5718#(<= main_~x~0 57)} assume !!(~x~0 < 100); {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:34,665 INFO L290 TraceCheckUtils]: 121: Hoare triple {5718#(<= main_~x~0 57)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:34,665 INFO L290 TraceCheckUtils]: 122: Hoare triple {5719#(<= main_~x~0 58)} assume !!(~x~0 < 100); {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:34,665 INFO L290 TraceCheckUtils]: 123: Hoare triple {5719#(<= main_~x~0 58)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:34,665 INFO L290 TraceCheckUtils]: 124: Hoare triple {5720#(<= main_~x~0 59)} assume !!(~x~0 < 100); {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:34,666 INFO L290 TraceCheckUtils]: 125: Hoare triple {5720#(<= main_~x~0 59)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:34,666 INFO L290 TraceCheckUtils]: 126: Hoare triple {5721#(<= main_~x~0 60)} assume !!(~x~0 < 100); {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:34,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {5721#(<= main_~x~0 60)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:34,667 INFO L290 TraceCheckUtils]: 128: Hoare triple {5722#(<= main_~x~0 61)} assume !!(~x~0 < 100); {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:34,667 INFO L290 TraceCheckUtils]: 129: Hoare triple {5722#(<= main_~x~0 61)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:34,667 INFO L290 TraceCheckUtils]: 130: Hoare triple {5723#(<= main_~x~0 62)} assume !!(~x~0 < 100); {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:34,668 INFO L290 TraceCheckUtils]: 131: Hoare triple {5723#(<= main_~x~0 62)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:34,668 INFO L290 TraceCheckUtils]: 132: Hoare triple {5724#(<= main_~x~0 63)} assume !!(~x~0 < 100); {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:34,668 INFO L290 TraceCheckUtils]: 133: Hoare triple {5724#(<= main_~x~0 63)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {5725#(<= main_~x~0 64)} is VALID [2022-04-27 10:52:34,668 INFO L290 TraceCheckUtils]: 134: Hoare triple {5725#(<= main_~x~0 64)} assume !(~x~0 < 100); {5657#false} is VALID [2022-04-27 10:52:34,669 INFO L272 TraceCheckUtils]: 135: Hoare triple {5657#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5657#false} is VALID [2022-04-27 10:52:34,669 INFO L290 TraceCheckUtils]: 136: Hoare triple {5657#false} ~cond := #in~cond; {5657#false} is VALID [2022-04-27 10:52:34,669 INFO L290 TraceCheckUtils]: 137: Hoare triple {5657#false} assume 0 == ~cond; {5657#false} is VALID [2022-04-27 10:52:34,669 INFO L290 TraceCheckUtils]: 138: Hoare triple {5657#false} assume !false; {5657#false} is VALID [2022-04-27 10:52:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:34,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:37,092 INFO L290 TraceCheckUtils]: 138: Hoare triple {5657#false} assume !false; {5657#false} is VALID [2022-04-27 10:52:37,092 INFO L290 TraceCheckUtils]: 137: Hoare triple {5657#false} assume 0 == ~cond; {5657#false} is VALID [2022-04-27 10:52:37,092 INFO L290 TraceCheckUtils]: 136: Hoare triple {5657#false} ~cond := #in~cond; {5657#false} is VALID [2022-04-27 10:52:37,092 INFO L272 TraceCheckUtils]: 135: Hoare triple {5657#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {5657#false} is VALID [2022-04-27 10:52:37,092 INFO L290 TraceCheckUtils]: 134: Hoare triple {6157#(< main_~x~0 100)} assume !(~x~0 < 100); {5657#false} is VALID [2022-04-27 10:52:37,093 INFO L290 TraceCheckUtils]: 133: Hoare triple {6161#(< main_~x~0 99)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6157#(< main_~x~0 100)} is VALID [2022-04-27 10:52:37,093 INFO L290 TraceCheckUtils]: 132: Hoare triple {6161#(< main_~x~0 99)} assume !!(~x~0 < 100); {6161#(< main_~x~0 99)} is VALID [2022-04-27 10:52:37,093 INFO L290 TraceCheckUtils]: 131: Hoare triple {6168#(< main_~x~0 98)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6161#(< main_~x~0 99)} is VALID [2022-04-27 10:52:37,094 INFO L290 TraceCheckUtils]: 130: Hoare triple {6168#(< main_~x~0 98)} assume !!(~x~0 < 100); {6168#(< main_~x~0 98)} is VALID [2022-04-27 10:52:37,094 INFO L290 TraceCheckUtils]: 129: Hoare triple {6175#(< main_~x~0 97)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6168#(< main_~x~0 98)} is VALID [2022-04-27 10:52:37,094 INFO L290 TraceCheckUtils]: 128: Hoare triple {6175#(< main_~x~0 97)} assume !!(~x~0 < 100); {6175#(< main_~x~0 97)} is VALID [2022-04-27 10:52:37,095 INFO L290 TraceCheckUtils]: 127: Hoare triple {6182#(< main_~x~0 96)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6175#(< main_~x~0 97)} is VALID [2022-04-27 10:52:37,095 INFO L290 TraceCheckUtils]: 126: Hoare triple {6182#(< main_~x~0 96)} assume !!(~x~0 < 100); {6182#(< main_~x~0 96)} is VALID [2022-04-27 10:52:37,095 INFO L290 TraceCheckUtils]: 125: Hoare triple {6189#(< main_~x~0 95)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6182#(< main_~x~0 96)} is VALID [2022-04-27 10:52:37,096 INFO L290 TraceCheckUtils]: 124: Hoare triple {6189#(< main_~x~0 95)} assume !!(~x~0 < 100); {6189#(< main_~x~0 95)} is VALID [2022-04-27 10:52:37,096 INFO L290 TraceCheckUtils]: 123: Hoare triple {6196#(< main_~x~0 94)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6189#(< main_~x~0 95)} is VALID [2022-04-27 10:52:37,096 INFO L290 TraceCheckUtils]: 122: Hoare triple {6196#(< main_~x~0 94)} assume !!(~x~0 < 100); {6196#(< main_~x~0 94)} is VALID [2022-04-27 10:52:37,097 INFO L290 TraceCheckUtils]: 121: Hoare triple {6203#(< main_~x~0 93)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6196#(< main_~x~0 94)} is VALID [2022-04-27 10:52:37,097 INFO L290 TraceCheckUtils]: 120: Hoare triple {6203#(< main_~x~0 93)} assume !!(~x~0 < 100); {6203#(< main_~x~0 93)} is VALID [2022-04-27 10:52:37,097 INFO L290 TraceCheckUtils]: 119: Hoare triple {6210#(< main_~x~0 92)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6203#(< main_~x~0 93)} is VALID [2022-04-27 10:52:37,097 INFO L290 TraceCheckUtils]: 118: Hoare triple {6210#(< main_~x~0 92)} assume !!(~x~0 < 100); {6210#(< main_~x~0 92)} is VALID [2022-04-27 10:52:37,098 INFO L290 TraceCheckUtils]: 117: Hoare triple {6217#(< main_~x~0 91)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6210#(< main_~x~0 92)} is VALID [2022-04-27 10:52:37,098 INFO L290 TraceCheckUtils]: 116: Hoare triple {6217#(< main_~x~0 91)} assume !!(~x~0 < 100); {6217#(< main_~x~0 91)} is VALID [2022-04-27 10:52:37,098 INFO L290 TraceCheckUtils]: 115: Hoare triple {6224#(< main_~x~0 90)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6217#(< main_~x~0 91)} is VALID [2022-04-27 10:52:37,099 INFO L290 TraceCheckUtils]: 114: Hoare triple {6224#(< main_~x~0 90)} assume !!(~x~0 < 100); {6224#(< main_~x~0 90)} is VALID [2022-04-27 10:52:37,099 INFO L290 TraceCheckUtils]: 113: Hoare triple {6231#(< main_~x~0 89)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6224#(< main_~x~0 90)} is VALID [2022-04-27 10:52:37,099 INFO L290 TraceCheckUtils]: 112: Hoare triple {6231#(< main_~x~0 89)} assume !!(~x~0 < 100); {6231#(< main_~x~0 89)} is VALID [2022-04-27 10:52:37,100 INFO L290 TraceCheckUtils]: 111: Hoare triple {6238#(< main_~x~0 88)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6231#(< main_~x~0 89)} is VALID [2022-04-27 10:52:37,100 INFO L290 TraceCheckUtils]: 110: Hoare triple {6238#(< main_~x~0 88)} assume !!(~x~0 < 100); {6238#(< main_~x~0 88)} is VALID [2022-04-27 10:52:37,100 INFO L290 TraceCheckUtils]: 109: Hoare triple {6245#(< main_~x~0 87)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6238#(< main_~x~0 88)} is VALID [2022-04-27 10:52:37,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {6245#(< main_~x~0 87)} assume !!(~x~0 < 100); {6245#(< main_~x~0 87)} is VALID [2022-04-27 10:52:37,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {6252#(< main_~x~0 86)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {6245#(< main_~x~0 87)} is VALID [2022-04-27 10:52:37,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {6252#(< main_~x~0 86)} assume !!(~x~0 < 100); {6252#(< main_~x~0 86)} is VALID [2022-04-27 10:52:37,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {6259#(< main_~x~0 85)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6252#(< main_~x~0 86)} is VALID [2022-04-27 10:52:37,102 INFO L290 TraceCheckUtils]: 104: Hoare triple {6259#(< main_~x~0 85)} assume !!(~x~0 < 100); {6259#(< main_~x~0 85)} is VALID [2022-04-27 10:52:37,102 INFO L290 TraceCheckUtils]: 103: Hoare triple {6266#(< main_~x~0 84)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6259#(< main_~x~0 85)} is VALID [2022-04-27 10:52:37,102 INFO L290 TraceCheckUtils]: 102: Hoare triple {6266#(< main_~x~0 84)} assume !!(~x~0 < 100); {6266#(< main_~x~0 84)} is VALID [2022-04-27 10:52:37,103 INFO L290 TraceCheckUtils]: 101: Hoare triple {6273#(< main_~x~0 83)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6266#(< main_~x~0 84)} is VALID [2022-04-27 10:52:37,103 INFO L290 TraceCheckUtils]: 100: Hoare triple {6273#(< main_~x~0 83)} assume !!(~x~0 < 100); {6273#(< main_~x~0 83)} is VALID [2022-04-27 10:52:37,103 INFO L290 TraceCheckUtils]: 99: Hoare triple {6280#(< main_~x~0 82)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6273#(< main_~x~0 83)} is VALID [2022-04-27 10:52:37,103 INFO L290 TraceCheckUtils]: 98: Hoare triple {6280#(< main_~x~0 82)} assume !!(~x~0 < 100); {6280#(< main_~x~0 82)} is VALID [2022-04-27 10:52:37,104 INFO L290 TraceCheckUtils]: 97: Hoare triple {6287#(< main_~x~0 81)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6280#(< main_~x~0 82)} is VALID [2022-04-27 10:52:37,104 INFO L290 TraceCheckUtils]: 96: Hoare triple {6287#(< main_~x~0 81)} assume !!(~x~0 < 100); {6287#(< main_~x~0 81)} is VALID [2022-04-27 10:52:37,104 INFO L290 TraceCheckUtils]: 95: Hoare triple {6294#(< main_~x~0 80)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6287#(< main_~x~0 81)} is VALID [2022-04-27 10:52:37,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {6294#(< main_~x~0 80)} assume !!(~x~0 < 100); {6294#(< main_~x~0 80)} is VALID [2022-04-27 10:52:37,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {6301#(< main_~x~0 79)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6294#(< main_~x~0 80)} is VALID [2022-04-27 10:52:37,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {6301#(< main_~x~0 79)} assume !!(~x~0 < 100); {6301#(< main_~x~0 79)} is VALID [2022-04-27 10:52:37,106 INFO L290 TraceCheckUtils]: 91: Hoare triple {6308#(< main_~x~0 78)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6301#(< main_~x~0 79)} is VALID [2022-04-27 10:52:37,106 INFO L290 TraceCheckUtils]: 90: Hoare triple {6308#(< main_~x~0 78)} assume !!(~x~0 < 100); {6308#(< main_~x~0 78)} is VALID [2022-04-27 10:52:37,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {6315#(< main_~x~0 77)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6308#(< main_~x~0 78)} is VALID [2022-04-27 10:52:37,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {6315#(< main_~x~0 77)} assume !!(~x~0 < 100); {6315#(< main_~x~0 77)} is VALID [2022-04-27 10:52:37,107 INFO L290 TraceCheckUtils]: 87: Hoare triple {6322#(< main_~x~0 76)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6315#(< main_~x~0 77)} is VALID [2022-04-27 10:52:37,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {6322#(< main_~x~0 76)} assume !!(~x~0 < 100); {6322#(< main_~x~0 76)} is VALID [2022-04-27 10:52:37,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {6329#(< main_~x~0 75)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6322#(< main_~x~0 76)} is VALID [2022-04-27 10:52:37,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {6329#(< main_~x~0 75)} assume !!(~x~0 < 100); {6329#(< main_~x~0 75)} is VALID [2022-04-27 10:52:37,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {6336#(< main_~x~0 74)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6329#(< main_~x~0 75)} is VALID [2022-04-27 10:52:37,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {6336#(< main_~x~0 74)} assume !!(~x~0 < 100); {6336#(< main_~x~0 74)} is VALID [2022-04-27 10:52:37,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {6343#(< main_~x~0 73)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6336#(< main_~x~0 74)} is VALID [2022-04-27 10:52:37,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {6343#(< main_~x~0 73)} assume !!(~x~0 < 100); {6343#(< main_~x~0 73)} is VALID [2022-04-27 10:52:37,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {6350#(< main_~x~0 72)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6343#(< main_~x~0 73)} is VALID [2022-04-27 10:52:37,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {6350#(< main_~x~0 72)} assume !!(~x~0 < 100); {6350#(< main_~x~0 72)} is VALID [2022-04-27 10:52:37,110 INFO L290 TraceCheckUtils]: 77: Hoare triple {6357#(< main_~x~0 71)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6350#(< main_~x~0 72)} is VALID [2022-04-27 10:52:37,110 INFO L290 TraceCheckUtils]: 76: Hoare triple {6357#(< main_~x~0 71)} assume !!(~x~0 < 100); {6357#(< main_~x~0 71)} is VALID [2022-04-27 10:52:37,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {6364#(< main_~x~0 70)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6357#(< main_~x~0 71)} is VALID [2022-04-27 10:52:37,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {6364#(< main_~x~0 70)} assume !!(~x~0 < 100); {6364#(< main_~x~0 70)} is VALID [2022-04-27 10:52:37,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {6371#(< main_~x~0 69)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6364#(< main_~x~0 70)} is VALID [2022-04-27 10:52:37,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {6371#(< main_~x~0 69)} assume !!(~x~0 < 100); {6371#(< main_~x~0 69)} is VALID [2022-04-27 10:52:37,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {6378#(< main_~x~0 68)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6371#(< main_~x~0 69)} is VALID [2022-04-27 10:52:37,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {6378#(< main_~x~0 68)} assume !!(~x~0 < 100); {6378#(< main_~x~0 68)} is VALID [2022-04-27 10:52:37,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {6385#(< main_~x~0 67)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6378#(< main_~x~0 68)} is VALID [2022-04-27 10:52:37,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {6385#(< main_~x~0 67)} assume !!(~x~0 < 100); {6385#(< main_~x~0 67)} is VALID [2022-04-27 10:52:37,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {6392#(< main_~x~0 66)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6385#(< main_~x~0 67)} is VALID [2022-04-27 10:52:37,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {6392#(< main_~x~0 66)} assume !!(~x~0 < 100); {6392#(< main_~x~0 66)} is VALID [2022-04-27 10:52:37,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {5725#(<= main_~x~0 64)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {6392#(< main_~x~0 66)} is VALID [2022-04-27 10:52:37,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {5725#(<= main_~x~0 64)} assume !!(~x~0 < 100); {5725#(<= main_~x~0 64)} is VALID [2022-04-27 10:52:37,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {5724#(<= main_~x~0 63)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5725#(<= main_~x~0 64)} is VALID [2022-04-27 10:52:37,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {5724#(<= main_~x~0 63)} assume !!(~x~0 < 100); {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:37,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {5723#(<= main_~x~0 62)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5724#(<= main_~x~0 63)} is VALID [2022-04-27 10:52:37,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {5723#(<= main_~x~0 62)} assume !!(~x~0 < 100); {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:37,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {5722#(<= main_~x~0 61)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5723#(<= main_~x~0 62)} is VALID [2022-04-27 10:52:37,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {5722#(<= main_~x~0 61)} assume !!(~x~0 < 100); {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:37,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {5721#(<= main_~x~0 60)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5722#(<= main_~x~0 61)} is VALID [2022-04-27 10:52:37,119 INFO L290 TraceCheckUtils]: 56: Hoare triple {5721#(<= main_~x~0 60)} assume !!(~x~0 < 100); {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:37,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {5720#(<= main_~x~0 59)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5721#(<= main_~x~0 60)} is VALID [2022-04-27 10:52:37,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {5720#(<= main_~x~0 59)} assume !!(~x~0 < 100); {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:37,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {5719#(<= main_~x~0 58)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5720#(<= main_~x~0 59)} is VALID [2022-04-27 10:52:37,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {5719#(<= main_~x~0 58)} assume !!(~x~0 < 100); {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:37,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {5718#(<= main_~x~0 57)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5719#(<= main_~x~0 58)} is VALID [2022-04-27 10:52:37,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {5718#(<= main_~x~0 57)} assume !!(~x~0 < 100); {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:37,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {5717#(<= main_~x~0 56)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5718#(<= main_~x~0 57)} is VALID [2022-04-27 10:52:37,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {5717#(<= main_~x~0 56)} assume !!(~x~0 < 100); {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:37,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {5716#(<= main_~x~0 55)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5717#(<= main_~x~0 56)} is VALID [2022-04-27 10:52:37,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {5716#(<= main_~x~0 55)} assume !!(~x~0 < 100); {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:37,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {5715#(<= main_~x~0 54)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5716#(<= main_~x~0 55)} is VALID [2022-04-27 10:52:37,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {5715#(<= main_~x~0 54)} assume !!(~x~0 < 100); {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:37,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {5714#(<= main_~x~0 53)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5715#(<= main_~x~0 54)} is VALID [2022-04-27 10:52:37,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= main_~x~0 53)} assume !!(~x~0 < 100); {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:37,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {5713#(<= main_~x~0 52)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5714#(<= main_~x~0 53)} is VALID [2022-04-27 10:52:37,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {5713#(<= main_~x~0 52)} assume !!(~x~0 < 100); {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:37,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {5712#(<= main_~x~0 51)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5713#(<= main_~x~0 52)} is VALID [2022-04-27 10:52:37,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {5712#(<= main_~x~0 51)} assume !!(~x~0 < 100); {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:37,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= main_~x~0 50)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5712#(<= main_~x~0 51)} is VALID [2022-04-27 10:52:37,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {5711#(<= main_~x~0 50)} assume !!(~x~0 < 100); {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:37,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {5710#(<= main_~x~0 49)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5711#(<= main_~x~0 50)} is VALID [2022-04-27 10:52:37,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {5710#(<= main_~x~0 49)} assume !!(~x~0 < 100); {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:37,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {5709#(<= main_~x~0 48)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5710#(<= main_~x~0 49)} is VALID [2022-04-27 10:52:37,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {5709#(<= main_~x~0 48)} assume !!(~x~0 < 100); {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:37,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {5708#(<= main_~x~0 47)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5709#(<= main_~x~0 48)} is VALID [2022-04-27 10:52:37,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {5708#(<= main_~x~0 47)} assume !!(~x~0 < 100); {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:37,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {5707#(<= main_~x~0 46)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5708#(<= main_~x~0 47)} is VALID [2022-04-27 10:52:37,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {5707#(<= main_~x~0 46)} assume !!(~x~0 < 100); {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:37,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {5706#(<= main_~x~0 45)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5707#(<= main_~x~0 46)} is VALID [2022-04-27 10:52:37,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {5706#(<= main_~x~0 45)} assume !!(~x~0 < 100); {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:37,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {5705#(<= main_~x~0 44)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5706#(<= main_~x~0 45)} is VALID [2022-04-27 10:52:37,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {5705#(<= main_~x~0 44)} assume !!(~x~0 < 100); {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:37,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {5704#(<= main_~x~0 43)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5705#(<= main_~x~0 44)} is VALID [2022-04-27 10:52:37,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {5704#(<= main_~x~0 43)} assume !!(~x~0 < 100); {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:37,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {5703#(<= main_~x~0 42)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5704#(<= main_~x~0 43)} is VALID [2022-04-27 10:52:37,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#(<= main_~x~0 42)} assume !!(~x~0 < 100); {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:37,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {5702#(<= main_~x~0 41)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5703#(<= main_~x~0 42)} is VALID [2022-04-27 10:52:37,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {5702#(<= main_~x~0 41)} assume !!(~x~0 < 100); {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:37,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {5701#(<= main_~x~0 40)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5702#(<= main_~x~0 41)} is VALID [2022-04-27 10:52:37,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {5701#(<= main_~x~0 40)} assume !!(~x~0 < 100); {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:37,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {5700#(<= main_~x~0 39)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5701#(<= main_~x~0 40)} is VALID [2022-04-27 10:52:37,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5700#(<= main_~x~0 39)} assume !!(~x~0 < 100); {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:37,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {5699#(<= main_~x~0 38)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5700#(<= main_~x~0 39)} is VALID [2022-04-27 10:52:37,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {5699#(<= main_~x~0 38)} assume !!(~x~0 < 100); {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:37,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {5698#(<= main_~x~0 37)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5699#(<= main_~x~0 38)} is VALID [2022-04-27 10:52:37,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {5698#(<= main_~x~0 37)} assume !!(~x~0 < 100); {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:37,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {5697#(<= main_~x~0 36)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5698#(<= main_~x~0 37)} is VALID [2022-04-27 10:52:37,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {5697#(<= main_~x~0 36)} assume !!(~x~0 < 100); {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:37,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#(<= main_~x~0 35)} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {5697#(<= main_~x~0 36)} is VALID [2022-04-27 10:52:37,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#(<= main_~x~0 35)} assume !!(~x~0 < 100); {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:37,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {5656#true} ~x~0 := 0;~y~0 := 50; {5696#(<= main_~x~0 35)} is VALID [2022-04-27 10:52:37,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {5656#true} call #t~ret1 := main(); {5656#true} is VALID [2022-04-27 10:52:37,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5656#true} {5656#true} #56#return; {5656#true} is VALID [2022-04-27 10:52:37,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {5656#true} assume true; {5656#true} is VALID [2022-04-27 10:52:37,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {5656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5656#true} is VALID [2022-04-27 10:52:37,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {5656#true} call ULTIMATE.init(); {5656#true} is VALID [2022-04-27 10:52:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:52:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231253340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:37,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:37,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 104 [2022-04-27 10:52:37,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108661397] [2022-04-27 10:52:37,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 10:52:37,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:37,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:37,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-04-27 10:52:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-04-27 10:52:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-27 10:52:37,280 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:41,832 INFO L93 Difference]: Finished difference Result 217 states and 302 transitions. [2022-04-27 10:52:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-27 10:52:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-27 10:52:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:52:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 302 transitions. [2022-04-27 10:52:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 302 transitions. [2022-04-27 10:52:41,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 302 transitions. [2022-04-27 10:52:42,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:42,046 INFO L225 Difference]: With dead ends: 217 [2022-04-27 10:52:42,046 INFO L226 Difference]: Without dead ends: 212 [2022-04-27 10:52:42,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5906 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2022-04-27 10:52:42,050 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 206 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:52:42,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 43 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:52:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-27 10:52:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-27 10:52:42,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:52:42,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:42,154 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:42,155 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,157 INFO L93 Difference]: Finished difference Result 212 states and 262 transitions. [2022-04-27 10:52:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2022-04-27 10:52:42,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-27 10:52:42,158 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-27 10:52:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:52:42,161 INFO L93 Difference]: Finished difference Result 212 states and 262 transitions. [2022-04-27 10:52:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2022-04-27 10:52:42,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:52:42,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:52:42,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:52:42,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:52:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 262 transitions. [2022-04-27 10:52:42,165 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 262 transitions. Word has length 139 [2022-04-27 10:52:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:52:42,165 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 262 transitions. [2022-04-27 10:52:42,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.1634615384615383) internal successors, (225), 103 states have internal predecessors, (225), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2022-04-27 10:52:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-27 10:52:42,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:52:42,167 INFO L195 NwaCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:52:42,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 10:52:42,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 10:52:42,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:52:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:52:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1013048454, now seen corresponding path program 8 times [2022-04-27 10:52:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:52:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793135965] [2022-04-27 10:52:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:52:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:52:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:52:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:43,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7865#true} is VALID [2022-04-27 10:52:43,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {7865#true} assume true; {7865#true} is VALID [2022-04-27 10:52:43,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7865#true} {7865#true} #56#return; {7865#true} is VALID [2022-04-27 10:52:43,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {7865#true} call ULTIMATE.init(); {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:52:43,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7865#true} is VALID [2022-04-27 10:52:43,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {7865#true} assume true; {7865#true} is VALID [2022-04-27 10:52:43,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7865#true} {7865#true} #56#return; {7865#true} is VALID [2022-04-27 10:52:43,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {7865#true} call #t~ret1 := main(); {7865#true} is VALID [2022-04-27 10:52:43,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {7865#true} ~x~0 := 0;~y~0 := 50; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,867 INFO L290 TraceCheckUtils]: 63: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,867 INFO L290 TraceCheckUtils]: 64: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,868 INFO L290 TraceCheckUtils]: 67: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,868 INFO L290 TraceCheckUtils]: 69: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,869 INFO L290 TraceCheckUtils]: 72: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,869 INFO L290 TraceCheckUtils]: 73: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,870 INFO L290 TraceCheckUtils]: 75: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,870 INFO L290 TraceCheckUtils]: 76: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,871 INFO L290 TraceCheckUtils]: 79: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,872 INFO L290 TraceCheckUtils]: 80: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,872 INFO L290 TraceCheckUtils]: 81: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,872 INFO L290 TraceCheckUtils]: 82: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,872 INFO L290 TraceCheckUtils]: 83: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,873 INFO L290 TraceCheckUtils]: 84: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,874 INFO L290 TraceCheckUtils]: 87: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,875 INFO L290 TraceCheckUtils]: 90: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,875 INFO L290 TraceCheckUtils]: 91: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,875 INFO L290 TraceCheckUtils]: 92: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,876 INFO L290 TraceCheckUtils]: 93: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,876 INFO L290 TraceCheckUtils]: 95: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,877 INFO L290 TraceCheckUtils]: 96: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,877 INFO L290 TraceCheckUtils]: 97: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,877 INFO L290 TraceCheckUtils]: 98: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,878 INFO L290 TraceCheckUtils]: 102: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,880 INFO L290 TraceCheckUtils]: 106: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:43,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:43,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~x~0 < 100); {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:43,881 INFO L290 TraceCheckUtils]: 109: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:43,881 INFO L290 TraceCheckUtils]: 110: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~x~0 < 100); {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:43,881 INFO L290 TraceCheckUtils]: 111: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:43,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~x~0 < 100); {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:43,882 INFO L290 TraceCheckUtils]: 113: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:43,882 INFO L290 TraceCheckUtils]: 114: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~x~0 < 100); {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:43,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:43,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~x~0 < 100); {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:43,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:43,884 INFO L290 TraceCheckUtils]: 118: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~x~0 < 100); {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:43,884 INFO L290 TraceCheckUtils]: 119: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:43,884 INFO L290 TraceCheckUtils]: 120: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~x~0 < 100); {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:43,885 INFO L290 TraceCheckUtils]: 121: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:43,885 INFO L290 TraceCheckUtils]: 122: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~x~0 < 100); {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:43,886 INFO L290 TraceCheckUtils]: 123: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:43,886 INFO L290 TraceCheckUtils]: 124: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~x~0 < 100); {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:43,886 INFO L290 TraceCheckUtils]: 125: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:43,887 INFO L290 TraceCheckUtils]: 126: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~x~0 < 100); {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:43,887 INFO L290 TraceCheckUtils]: 127: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:43,887 INFO L290 TraceCheckUtils]: 128: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~x~0 < 100); {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:43,888 INFO L290 TraceCheckUtils]: 129: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:43,888 INFO L290 TraceCheckUtils]: 130: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~x~0 < 100); {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:43,888 INFO L290 TraceCheckUtils]: 131: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:43,889 INFO L290 TraceCheckUtils]: 132: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~x~0 < 100); {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:43,889 INFO L290 TraceCheckUtils]: 133: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:43,889 INFO L290 TraceCheckUtils]: 134: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~x~0 < 100); {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:43,890 INFO L290 TraceCheckUtils]: 135: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:43,890 INFO L290 TraceCheckUtils]: 136: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~x~0 < 100); {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:43,891 INFO L290 TraceCheckUtils]: 137: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:43,891 INFO L290 TraceCheckUtils]: 138: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~x~0 < 100); {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:43,891 INFO L290 TraceCheckUtils]: 139: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:43,892 INFO L290 TraceCheckUtils]: 140: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !!(~x~0 < 100); {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:43,892 INFO L290 TraceCheckUtils]: 141: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:43,893 INFO L290 TraceCheckUtils]: 142: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !!(~x~0 < 100); {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:43,894 INFO L290 TraceCheckUtils]: 143: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:43,894 INFO L290 TraceCheckUtils]: 144: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !!(~x~0 < 100); {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:43,894 INFO L290 TraceCheckUtils]: 145: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:43,895 INFO L290 TraceCheckUtils]: 146: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !!(~x~0 < 100); {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:43,895 INFO L290 TraceCheckUtils]: 147: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:43,895 INFO L290 TraceCheckUtils]: 148: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !!(~x~0 < 100); {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:43,896 INFO L290 TraceCheckUtils]: 149: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:43,896 INFO L290 TraceCheckUtils]: 150: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !!(~x~0 < 100); {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:43,896 INFO L290 TraceCheckUtils]: 151: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:43,897 INFO L290 TraceCheckUtils]: 152: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !!(~x~0 < 100); {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:43,897 INFO L290 TraceCheckUtils]: 153: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:43,897 INFO L290 TraceCheckUtils]: 154: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !!(~x~0 < 100); {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:43,898 INFO L290 TraceCheckUtils]: 155: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:43,898 INFO L290 TraceCheckUtils]: 156: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !!(~x~0 < 100); {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:43,899 INFO L290 TraceCheckUtils]: 157: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:43,899 INFO L290 TraceCheckUtils]: 158: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !!(~x~0 < 100); {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:43,899 INFO L290 TraceCheckUtils]: 159: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:43,900 INFO L290 TraceCheckUtils]: 160: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !!(~x~0 < 100); {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:43,900 INFO L290 TraceCheckUtils]: 161: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:43,900 INFO L290 TraceCheckUtils]: 162: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !!(~x~0 < 100); {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:43,901 INFO L290 TraceCheckUtils]: 163: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:43,901 INFO L290 TraceCheckUtils]: 164: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !!(~x~0 < 100); {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:43,901 INFO L290 TraceCheckUtils]: 165: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:43,902 INFO L290 TraceCheckUtils]: 166: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !!(~x~0 < 100); {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:43,902 INFO L290 TraceCheckUtils]: 167: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:43,903 INFO L290 TraceCheckUtils]: 168: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !!(~x~0 < 100); {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:43,903 INFO L290 TraceCheckUtils]: 169: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:43,903 INFO L290 TraceCheckUtils]: 170: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !!(~x~0 < 100); {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:43,904 INFO L290 TraceCheckUtils]: 171: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:43,904 INFO L290 TraceCheckUtils]: 172: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !!(~x~0 < 100); {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:43,904 INFO L290 TraceCheckUtils]: 173: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:43,905 INFO L290 TraceCheckUtils]: 174: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !!(~x~0 < 100); {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:43,905 INFO L290 TraceCheckUtils]: 175: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:43,911 INFO L290 TraceCheckUtils]: 176: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !!(~x~0 < 100); {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:43,911 INFO L290 TraceCheckUtils]: 177: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:43,912 INFO L290 TraceCheckUtils]: 178: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !!(~x~0 < 100); {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:43,912 INFO L290 TraceCheckUtils]: 179: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:43,912 INFO L290 TraceCheckUtils]: 180: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !!(~x~0 < 100); {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:43,913 INFO L290 TraceCheckUtils]: 181: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:43,913 INFO L290 TraceCheckUtils]: 182: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !!(~x~0 < 100); {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:43,914 INFO L290 TraceCheckUtils]: 183: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:43,914 INFO L290 TraceCheckUtils]: 184: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !!(~x~0 < 100); {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:43,914 INFO L290 TraceCheckUtils]: 185: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:43,915 INFO L290 TraceCheckUtils]: 186: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !!(~x~0 < 100); {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:43,915 INFO L290 TraceCheckUtils]: 187: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:43,915 INFO L290 TraceCheckUtils]: 188: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !!(~x~0 < 100); {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:43,916 INFO L290 TraceCheckUtils]: 189: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:43,916 INFO L290 TraceCheckUtils]: 190: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !!(~x~0 < 100); {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:43,917 INFO L290 TraceCheckUtils]: 191: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:43,917 INFO L290 TraceCheckUtils]: 192: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !!(~x~0 < 100); {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:43,917 INFO L290 TraceCheckUtils]: 193: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:43,918 INFO L290 TraceCheckUtils]: 194: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !!(~x~0 < 100); {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:43,918 INFO L290 TraceCheckUtils]: 195: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:43,918 INFO L290 TraceCheckUtils]: 196: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !!(~x~0 < 100); {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:43,919 INFO L290 TraceCheckUtils]: 197: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:43,919 INFO L290 TraceCheckUtils]: 198: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !!(~x~0 < 100); {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:43,919 INFO L290 TraceCheckUtils]: 199: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:43,920 INFO L290 TraceCheckUtils]: 200: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !!(~x~0 < 100); {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:43,920 INFO L290 TraceCheckUtils]: 201: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:43,920 INFO L290 TraceCheckUtils]: 202: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !!(~x~0 < 100); {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:43,921 INFO L290 TraceCheckUtils]: 203: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:43,921 INFO L290 TraceCheckUtils]: 204: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !!(~x~0 < 100); {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:43,922 INFO L290 TraceCheckUtils]: 205: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:43,922 INFO L290 TraceCheckUtils]: 206: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} assume !(~x~0 < 100); {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:43,922 INFO L272 TraceCheckUtils]: 207: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {7921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:52:43,923 INFO L290 TraceCheckUtils]: 208: Hoare triple {7921#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7922#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:52:43,923 INFO L290 TraceCheckUtils]: 209: Hoare triple {7922#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7866#false} is VALID [2022-04-27 10:52:43,923 INFO L290 TraceCheckUtils]: 210: Hoare triple {7866#false} assume !false; {7866#false} is VALID [2022-04-27 10:52:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-04-27 10:52:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:52:43,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793135965] [2022-04-27 10:52:43,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793135965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:52:43,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651211322] [2022-04-27 10:52:43,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:52:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:52:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:52:43,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:52:43,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:52:44,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:52:44,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:52:44,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-27 10:52:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:52:44,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:52:45,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {7865#true} call ULTIMATE.init(); {7865#true} is VALID [2022-04-27 10:52:45,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {7865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7865#true} is VALID [2022-04-27 10:52:45,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {7865#true} assume true; {7865#true} is VALID [2022-04-27 10:52:45,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7865#true} {7865#true} #56#return; {7865#true} is VALID [2022-04-27 10:52:45,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {7865#true} call #t~ret1 := main(); {7865#true} is VALID [2022-04-27 10:52:45,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {7865#true} ~x~0 := 0;~y~0 := 50; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,859 INFO L290 TraceCheckUtils]: 50: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,868 INFO L290 TraceCheckUtils]: 79: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,869 INFO L290 TraceCheckUtils]: 82: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,869 INFO L290 TraceCheckUtils]: 83: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,870 INFO L290 TraceCheckUtils]: 86: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,870 INFO L290 TraceCheckUtils]: 87: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,871 INFO L290 TraceCheckUtils]: 89: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,871 INFO L290 TraceCheckUtils]: 90: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,873 INFO L290 TraceCheckUtils]: 96: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,875 INFO L290 TraceCheckUtils]: 101: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,875 INFO L290 TraceCheckUtils]: 103: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,876 INFO L290 TraceCheckUtils]: 104: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,876 INFO L290 TraceCheckUtils]: 105: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,876 INFO L290 TraceCheckUtils]: 106: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:45,877 INFO L290 TraceCheckUtils]: 107: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:45,877 INFO L290 TraceCheckUtils]: 108: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~x~0 < 100); {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:45,878 INFO L290 TraceCheckUtils]: 109: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:45,878 INFO L290 TraceCheckUtils]: 110: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~x~0 < 100); {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:45,878 INFO L290 TraceCheckUtils]: 111: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:45,879 INFO L290 TraceCheckUtils]: 112: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~x~0 < 100); {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:45,879 INFO L290 TraceCheckUtils]: 113: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:45,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~x~0 < 100); {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:45,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:45,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~x~0 < 100); {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:45,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:45,881 INFO L290 TraceCheckUtils]: 118: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~x~0 < 100); {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:45,881 INFO L290 TraceCheckUtils]: 119: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:45,882 INFO L290 TraceCheckUtils]: 120: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~x~0 < 100); {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:45,882 INFO L290 TraceCheckUtils]: 121: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:45,882 INFO L290 TraceCheckUtils]: 122: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~x~0 < 100); {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:45,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:45,883 INFO L290 TraceCheckUtils]: 124: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~x~0 < 100); {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:45,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:45,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~x~0 < 100); {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:45,884 INFO L290 TraceCheckUtils]: 127: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:45,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~x~0 < 100); {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:45,885 INFO L290 TraceCheckUtils]: 129: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:45,885 INFO L290 TraceCheckUtils]: 130: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~x~0 < 100); {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:45,886 INFO L290 TraceCheckUtils]: 131: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:45,886 INFO L290 TraceCheckUtils]: 132: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~x~0 < 100); {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:45,886 INFO L290 TraceCheckUtils]: 133: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:45,887 INFO L290 TraceCheckUtils]: 134: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~x~0 < 100); {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:45,887 INFO L290 TraceCheckUtils]: 135: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:45,888 INFO L290 TraceCheckUtils]: 136: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~x~0 < 100); {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:45,888 INFO L290 TraceCheckUtils]: 137: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:45,888 INFO L290 TraceCheckUtils]: 138: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~x~0 < 100); {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:45,889 INFO L290 TraceCheckUtils]: 139: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:45,889 INFO L290 TraceCheckUtils]: 140: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !!(~x~0 < 100); {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:45,889 INFO L290 TraceCheckUtils]: 141: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:45,890 INFO L290 TraceCheckUtils]: 142: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !!(~x~0 < 100); {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:45,890 INFO L290 TraceCheckUtils]: 143: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:45,890 INFO L290 TraceCheckUtils]: 144: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !!(~x~0 < 100); {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:45,891 INFO L290 TraceCheckUtils]: 145: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:45,891 INFO L290 TraceCheckUtils]: 146: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !!(~x~0 < 100); {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:45,892 INFO L290 TraceCheckUtils]: 147: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:45,892 INFO L290 TraceCheckUtils]: 148: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !!(~x~0 < 100); {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:45,892 INFO L290 TraceCheckUtils]: 149: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:45,893 INFO L290 TraceCheckUtils]: 150: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !!(~x~0 < 100); {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:45,893 INFO L290 TraceCheckUtils]: 151: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:45,893 INFO L290 TraceCheckUtils]: 152: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !!(~x~0 < 100); {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:45,894 INFO L290 TraceCheckUtils]: 153: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:45,894 INFO L290 TraceCheckUtils]: 154: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !!(~x~0 < 100); {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:45,894 INFO L290 TraceCheckUtils]: 155: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:45,895 INFO L290 TraceCheckUtils]: 156: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !!(~x~0 < 100); {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:45,895 INFO L290 TraceCheckUtils]: 157: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:45,895 INFO L290 TraceCheckUtils]: 158: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !!(~x~0 < 100); {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:45,896 INFO L290 TraceCheckUtils]: 159: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:45,896 INFO L290 TraceCheckUtils]: 160: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !!(~x~0 < 100); {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:45,897 INFO L290 TraceCheckUtils]: 161: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:45,897 INFO L290 TraceCheckUtils]: 162: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !!(~x~0 < 100); {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:45,897 INFO L290 TraceCheckUtils]: 163: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:45,897 INFO L290 TraceCheckUtils]: 164: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !!(~x~0 < 100); {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:45,898 INFO L290 TraceCheckUtils]: 165: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:45,898 INFO L290 TraceCheckUtils]: 166: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !!(~x~0 < 100); {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:45,899 INFO L290 TraceCheckUtils]: 167: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:45,899 INFO L290 TraceCheckUtils]: 168: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !!(~x~0 < 100); {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:45,899 INFO L290 TraceCheckUtils]: 169: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:45,900 INFO L290 TraceCheckUtils]: 170: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !!(~x~0 < 100); {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:45,900 INFO L290 TraceCheckUtils]: 171: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:45,900 INFO L290 TraceCheckUtils]: 172: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !!(~x~0 < 100); {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:45,901 INFO L290 TraceCheckUtils]: 173: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:45,901 INFO L290 TraceCheckUtils]: 174: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !!(~x~0 < 100); {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:45,901 INFO L290 TraceCheckUtils]: 175: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:45,902 INFO L290 TraceCheckUtils]: 176: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !!(~x~0 < 100); {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:45,902 INFO L290 TraceCheckUtils]: 177: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:45,902 INFO L290 TraceCheckUtils]: 178: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !!(~x~0 < 100); {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:45,903 INFO L290 TraceCheckUtils]: 179: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:45,903 INFO L290 TraceCheckUtils]: 180: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !!(~x~0 < 100); {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:45,903 INFO L290 TraceCheckUtils]: 181: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:45,904 INFO L290 TraceCheckUtils]: 182: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !!(~x~0 < 100); {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:45,904 INFO L290 TraceCheckUtils]: 183: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:45,904 INFO L290 TraceCheckUtils]: 184: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !!(~x~0 < 100); {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:45,905 INFO L290 TraceCheckUtils]: 185: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:45,905 INFO L290 TraceCheckUtils]: 186: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !!(~x~0 < 100); {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:45,905 INFO L290 TraceCheckUtils]: 187: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:45,906 INFO L290 TraceCheckUtils]: 188: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !!(~x~0 < 100); {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:45,906 INFO L290 TraceCheckUtils]: 189: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:45,906 INFO L290 TraceCheckUtils]: 190: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !!(~x~0 < 100); {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:45,907 INFO L290 TraceCheckUtils]: 191: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:45,907 INFO L290 TraceCheckUtils]: 192: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !!(~x~0 < 100); {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:45,908 INFO L290 TraceCheckUtils]: 193: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:45,908 INFO L290 TraceCheckUtils]: 194: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !!(~x~0 < 100); {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:45,908 INFO L290 TraceCheckUtils]: 195: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:45,909 INFO L290 TraceCheckUtils]: 196: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !!(~x~0 < 100); {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:45,909 INFO L290 TraceCheckUtils]: 197: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:45,909 INFO L290 TraceCheckUtils]: 198: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !!(~x~0 < 100); {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:45,910 INFO L290 TraceCheckUtils]: 199: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:45,910 INFO L290 TraceCheckUtils]: 200: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !!(~x~0 < 100); {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:45,910 INFO L290 TraceCheckUtils]: 201: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:45,911 INFO L290 TraceCheckUtils]: 202: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !!(~x~0 < 100); {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:45,911 INFO L290 TraceCheckUtils]: 203: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:45,911 INFO L290 TraceCheckUtils]: 204: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !!(~x~0 < 100); {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:45,912 INFO L290 TraceCheckUtils]: 205: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:45,912 INFO L290 TraceCheckUtils]: 206: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} assume !(~x~0 < 100); {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:45,913 INFO L272 TraceCheckUtils]: 207: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:52:45,913 INFO L290 TraceCheckUtils]: 208: Hoare triple {8548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:52:45,913 INFO L290 TraceCheckUtils]: 209: Hoare triple {8552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7866#false} is VALID [2022-04-27 10:52:45,913 INFO L290 TraceCheckUtils]: 210: Hoare triple {7866#false} assume !false; {7866#false} is VALID [2022-04-27 10:52:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-04-27 10:52:45,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:52:47,521 INFO L290 TraceCheckUtils]: 210: Hoare triple {7866#false} assume !false; {7866#false} is VALID [2022-04-27 10:52:47,522 INFO L290 TraceCheckUtils]: 209: Hoare triple {8552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7866#false} is VALID [2022-04-27 10:52:47,524 INFO L290 TraceCheckUtils]: 208: Hoare triple {8548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:52:47,525 INFO L272 TraceCheckUtils]: 207: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {8548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:52:47,525 INFO L290 TraceCheckUtils]: 206: Hoare triple {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} assume !(~x~0 < 100); {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:47,526 INFO L290 TraceCheckUtils]: 205: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7920#(and (< 99 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-27 10:52:47,526 INFO L290 TraceCheckUtils]: 204: Hoare triple {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} assume !!(~x~0 < 100); {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:47,526 INFO L290 TraceCheckUtils]: 203: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7919#(and (<= main_~y~0 99) (<= 99 main_~y~0))} is VALID [2022-04-27 10:52:47,527 INFO L290 TraceCheckUtils]: 202: Hoare triple {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} assume !!(~x~0 < 100); {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:47,527 INFO L290 TraceCheckUtils]: 201: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7918#(and (<= 98 main_~y~0) (<= main_~y~0 98))} is VALID [2022-04-27 10:52:47,527 INFO L290 TraceCheckUtils]: 200: Hoare triple {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} assume !!(~x~0 < 100); {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:47,528 INFO L290 TraceCheckUtils]: 199: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7917#(and (<= 97 main_~y~0) (<= main_~y~0 97))} is VALID [2022-04-27 10:52:47,528 INFO L290 TraceCheckUtils]: 198: Hoare triple {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} assume !!(~x~0 < 100); {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:47,529 INFO L290 TraceCheckUtils]: 197: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7916#(and (<= 96 main_~y~0) (<= main_~y~0 96))} is VALID [2022-04-27 10:52:47,529 INFO L290 TraceCheckUtils]: 196: Hoare triple {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} assume !!(~x~0 < 100); {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:47,529 INFO L290 TraceCheckUtils]: 195: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7915#(and (<= 95 main_~y~0) (<= main_~y~0 95))} is VALID [2022-04-27 10:52:47,530 INFO L290 TraceCheckUtils]: 194: Hoare triple {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} assume !!(~x~0 < 100); {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:47,530 INFO L290 TraceCheckUtils]: 193: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7914#(and (<= main_~y~0 94) (<= 94 main_~y~0))} is VALID [2022-04-27 10:52:47,530 INFO L290 TraceCheckUtils]: 192: Hoare triple {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} assume !!(~x~0 < 100); {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:47,531 INFO L290 TraceCheckUtils]: 191: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7913#(and (<= 93 main_~y~0) (<= main_~y~0 93))} is VALID [2022-04-27 10:52:47,531 INFO L290 TraceCheckUtils]: 190: Hoare triple {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} assume !!(~x~0 < 100); {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:47,531 INFO L290 TraceCheckUtils]: 189: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7912#(and (<= 92 main_~y~0) (<= main_~y~0 92))} is VALID [2022-04-27 10:52:47,532 INFO L290 TraceCheckUtils]: 188: Hoare triple {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} assume !!(~x~0 < 100); {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:47,532 INFO L290 TraceCheckUtils]: 187: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7911#(and (<= 91 main_~y~0) (<= main_~y~0 91))} is VALID [2022-04-27 10:52:47,532 INFO L290 TraceCheckUtils]: 186: Hoare triple {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} assume !!(~x~0 < 100); {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:47,533 INFO L290 TraceCheckUtils]: 185: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7910#(and (<= 90 main_~y~0) (<= main_~y~0 90))} is VALID [2022-04-27 10:52:47,533 INFO L290 TraceCheckUtils]: 184: Hoare triple {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} assume !!(~x~0 < 100); {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:47,533 INFO L290 TraceCheckUtils]: 183: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7909#(and (<= main_~y~0 89) (<= 89 main_~y~0))} is VALID [2022-04-27 10:52:47,534 INFO L290 TraceCheckUtils]: 182: Hoare triple {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} assume !!(~x~0 < 100); {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:47,534 INFO L290 TraceCheckUtils]: 181: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7908#(and (<= main_~y~0 88) (<= 88 main_~y~0))} is VALID [2022-04-27 10:52:47,534 INFO L290 TraceCheckUtils]: 180: Hoare triple {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} assume !!(~x~0 < 100); {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:47,535 INFO L290 TraceCheckUtils]: 179: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7907#(and (<= main_~y~0 87) (<= 87 main_~y~0))} is VALID [2022-04-27 10:52:47,535 INFO L290 TraceCheckUtils]: 178: Hoare triple {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} assume !!(~x~0 < 100); {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:47,535 INFO L290 TraceCheckUtils]: 177: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7906#(and (<= 86 main_~y~0) (<= main_~y~0 86))} is VALID [2022-04-27 10:52:47,536 INFO L290 TraceCheckUtils]: 176: Hoare triple {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} assume !!(~x~0 < 100); {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:47,536 INFO L290 TraceCheckUtils]: 175: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7905#(and (<= main_~y~0 85) (<= 85 main_~y~0))} is VALID [2022-04-27 10:52:47,536 INFO L290 TraceCheckUtils]: 174: Hoare triple {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} assume !!(~x~0 < 100); {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:47,537 INFO L290 TraceCheckUtils]: 173: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7904#(and (<= main_~y~0 84) (<= 84 main_~y~0))} is VALID [2022-04-27 10:52:47,537 INFO L290 TraceCheckUtils]: 172: Hoare triple {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} assume !!(~x~0 < 100); {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:47,538 INFO L290 TraceCheckUtils]: 171: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7903#(and (<= 83 main_~y~0) (<= main_~y~0 83))} is VALID [2022-04-27 10:52:47,538 INFO L290 TraceCheckUtils]: 170: Hoare triple {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} assume !!(~x~0 < 100); {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:47,538 INFO L290 TraceCheckUtils]: 169: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7902#(and (<= 82 main_~y~0) (<= main_~y~0 82))} is VALID [2022-04-27 10:52:47,539 INFO L290 TraceCheckUtils]: 168: Hoare triple {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} assume !!(~x~0 < 100); {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:47,539 INFO L290 TraceCheckUtils]: 167: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7901#(and (<= main_~y~0 81) (<= 81 main_~y~0))} is VALID [2022-04-27 10:52:47,539 INFO L290 TraceCheckUtils]: 166: Hoare triple {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} assume !!(~x~0 < 100); {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:47,540 INFO L290 TraceCheckUtils]: 165: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7900#(and (<= main_~y~0 80) (<= 80 main_~y~0))} is VALID [2022-04-27 10:52:47,540 INFO L290 TraceCheckUtils]: 164: Hoare triple {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} assume !!(~x~0 < 100); {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:47,540 INFO L290 TraceCheckUtils]: 163: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7899#(and (<= main_~y~0 79) (<= 79 main_~y~0))} is VALID [2022-04-27 10:52:47,541 INFO L290 TraceCheckUtils]: 162: Hoare triple {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} assume !!(~x~0 < 100); {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:47,542 INFO L290 TraceCheckUtils]: 161: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7898#(and (<= 78 main_~y~0) (<= main_~y~0 78))} is VALID [2022-04-27 10:52:47,542 INFO L290 TraceCheckUtils]: 160: Hoare triple {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} assume !!(~x~0 < 100); {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:47,544 INFO L290 TraceCheckUtils]: 159: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7897#(and (<= 77 main_~y~0) (<= main_~y~0 77))} is VALID [2022-04-27 10:52:47,544 INFO L290 TraceCheckUtils]: 158: Hoare triple {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} assume !!(~x~0 < 100); {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:47,550 INFO L290 TraceCheckUtils]: 157: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7896#(and (<= main_~y~0 76) (<= 76 main_~y~0))} is VALID [2022-04-27 10:52:47,550 INFO L290 TraceCheckUtils]: 156: Hoare triple {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} assume !!(~x~0 < 100); {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:47,551 INFO L290 TraceCheckUtils]: 155: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7895#(and (<= 75 main_~y~0) (<= main_~y~0 75))} is VALID [2022-04-27 10:52:47,551 INFO L290 TraceCheckUtils]: 154: Hoare triple {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} assume !!(~x~0 < 100); {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:47,551 INFO L290 TraceCheckUtils]: 153: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7894#(and (<= 74 main_~y~0) (<= main_~y~0 74))} is VALID [2022-04-27 10:52:47,552 INFO L290 TraceCheckUtils]: 152: Hoare triple {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} assume !!(~x~0 < 100); {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:47,552 INFO L290 TraceCheckUtils]: 151: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7893#(and (<= main_~y~0 73) (<= 73 main_~y~0))} is VALID [2022-04-27 10:52:47,553 INFO L290 TraceCheckUtils]: 150: Hoare triple {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} assume !!(~x~0 < 100); {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:47,555 INFO L290 TraceCheckUtils]: 149: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7892#(and (<= main_~y~0 72) (<= 72 main_~y~0))} is VALID [2022-04-27 10:52:47,556 INFO L290 TraceCheckUtils]: 148: Hoare triple {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} assume !!(~x~0 < 100); {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:47,556 INFO L290 TraceCheckUtils]: 147: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7891#(and (<= main_~y~0 71) (<= 71 main_~y~0))} is VALID [2022-04-27 10:52:47,556 INFO L290 TraceCheckUtils]: 146: Hoare triple {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} assume !!(~x~0 < 100); {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:47,557 INFO L290 TraceCheckUtils]: 145: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7890#(and (<= 70 main_~y~0) (<= main_~y~0 70))} is VALID [2022-04-27 10:52:47,557 INFO L290 TraceCheckUtils]: 144: Hoare triple {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} assume !!(~x~0 < 100); {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:47,557 INFO L290 TraceCheckUtils]: 143: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7889#(and (<= main_~y~0 69) (<= 69 main_~y~0))} is VALID [2022-04-27 10:52:47,558 INFO L290 TraceCheckUtils]: 142: Hoare triple {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} assume !!(~x~0 < 100); {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:47,558 INFO L290 TraceCheckUtils]: 141: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7888#(and (<= main_~y~0 68) (<= 68 main_~y~0))} is VALID [2022-04-27 10:52:47,558 INFO L290 TraceCheckUtils]: 140: Hoare triple {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} assume !!(~x~0 < 100); {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:47,559 INFO L290 TraceCheckUtils]: 139: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7887#(and (<= main_~y~0 67) (<= 67 main_~y~0))} is VALID [2022-04-27 10:52:47,559 INFO L290 TraceCheckUtils]: 138: Hoare triple {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} assume !!(~x~0 < 100); {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:47,559 INFO L290 TraceCheckUtils]: 137: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7886#(and (<= 66 main_~y~0) (<= main_~y~0 66))} is VALID [2022-04-27 10:52:47,560 INFO L290 TraceCheckUtils]: 136: Hoare triple {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} assume !!(~x~0 < 100); {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:47,560 INFO L290 TraceCheckUtils]: 135: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7885#(and (<= 65 main_~y~0) (<= main_~y~0 65))} is VALID [2022-04-27 10:52:47,560 INFO L290 TraceCheckUtils]: 134: Hoare triple {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} assume !!(~x~0 < 100); {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:47,561 INFO L290 TraceCheckUtils]: 133: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7884#(and (<= 64 main_~y~0) (<= main_~y~0 64))} is VALID [2022-04-27 10:52:47,561 INFO L290 TraceCheckUtils]: 132: Hoare triple {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} assume !!(~x~0 < 100); {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:47,561 INFO L290 TraceCheckUtils]: 131: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7883#(and (<= 63 main_~y~0) (<= main_~y~0 63))} is VALID [2022-04-27 10:52:47,562 INFO L290 TraceCheckUtils]: 130: Hoare triple {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} assume !!(~x~0 < 100); {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:47,562 INFO L290 TraceCheckUtils]: 129: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7882#(and (<= main_~y~0 62) (<= 62 main_~y~0))} is VALID [2022-04-27 10:52:47,562 INFO L290 TraceCheckUtils]: 128: Hoare triple {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} assume !!(~x~0 < 100); {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:47,563 INFO L290 TraceCheckUtils]: 127: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7881#(and (<= main_~y~0 61) (<= 61 main_~y~0))} is VALID [2022-04-27 10:52:47,563 INFO L290 TraceCheckUtils]: 126: Hoare triple {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} assume !!(~x~0 < 100); {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:47,564 INFO L290 TraceCheckUtils]: 125: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7880#(and (<= 60 main_~y~0) (<= main_~y~0 60))} is VALID [2022-04-27 10:52:47,564 INFO L290 TraceCheckUtils]: 124: Hoare triple {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} assume !!(~x~0 < 100); {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:47,564 INFO L290 TraceCheckUtils]: 123: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7879#(and (<= main_~y~0 59) (<= 59 main_~y~0))} is VALID [2022-04-27 10:52:47,565 INFO L290 TraceCheckUtils]: 122: Hoare triple {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} assume !!(~x~0 < 100); {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:47,565 INFO L290 TraceCheckUtils]: 121: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7878#(and (<= 58 main_~y~0) (<= main_~y~0 58))} is VALID [2022-04-27 10:52:47,565 INFO L290 TraceCheckUtils]: 120: Hoare triple {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} assume !!(~x~0 < 100); {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:47,566 INFO L290 TraceCheckUtils]: 119: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7877#(and (<= main_~y~0 57) (<= 57 main_~y~0))} is VALID [2022-04-27 10:52:47,566 INFO L290 TraceCheckUtils]: 118: Hoare triple {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} assume !!(~x~0 < 100); {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:47,566 INFO L290 TraceCheckUtils]: 117: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7876#(and (<= main_~y~0 56) (<= 56 main_~y~0))} is VALID [2022-04-27 10:52:47,567 INFO L290 TraceCheckUtils]: 116: Hoare triple {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} assume !!(~x~0 < 100); {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:47,567 INFO L290 TraceCheckUtils]: 115: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7875#(and (<= 55 main_~y~0) (<= main_~y~0 55))} is VALID [2022-04-27 10:52:47,567 INFO L290 TraceCheckUtils]: 114: Hoare triple {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} assume !!(~x~0 < 100); {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:47,568 INFO L290 TraceCheckUtils]: 113: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7874#(and (<= 54 main_~y~0) (<= main_~y~0 54))} is VALID [2022-04-27 10:52:47,568 INFO L290 TraceCheckUtils]: 112: Hoare triple {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} assume !!(~x~0 < 100); {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:47,568 INFO L290 TraceCheckUtils]: 111: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7873#(and (<= main_~y~0 53) (<= 53 main_~y~0))} is VALID [2022-04-27 10:52:47,569 INFO L290 TraceCheckUtils]: 110: Hoare triple {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} assume !!(~x~0 < 100); {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:47,569 INFO L290 TraceCheckUtils]: 109: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7872#(and (<= main_~y~0 52) (<= 52 main_~y~0))} is VALID [2022-04-27 10:52:47,569 INFO L290 TraceCheckUtils]: 108: Hoare triple {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} assume !!(~x~0 < 100); {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:47,570 INFO L290 TraceCheckUtils]: 107: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {7871#(and (<= 51 main_~y~0) (<= main_~y~0 51))} is VALID [2022-04-27 10:52:47,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,570 INFO L290 TraceCheckUtils]: 105: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,571 INFO L290 TraceCheckUtils]: 104: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,571 INFO L290 TraceCheckUtils]: 103: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,571 INFO L290 TraceCheckUtils]: 102: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,572 INFO L290 TraceCheckUtils]: 101: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,572 INFO L290 TraceCheckUtils]: 100: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,572 INFO L290 TraceCheckUtils]: 99: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,572 INFO L290 TraceCheckUtils]: 98: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,574 INFO L290 TraceCheckUtils]: 94: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,574 INFO L290 TraceCheckUtils]: 93: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,599 INFO L290 TraceCheckUtils]: 92: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,601 INFO L290 TraceCheckUtils]: 89: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,602 INFO L290 TraceCheckUtils]: 84: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,603 INFO L290 TraceCheckUtils]: 80: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,611 INFO L290 TraceCheckUtils]: 60: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} assume !!(~x~0 < 100); {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {7865#true} ~x~0 := 0;~y~0 := 50; {7870#(and (<= 50 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 10:52:47,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {7865#true} call #t~ret1 := main(); {7865#true} is VALID [2022-04-27 10:52:47,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7865#true} {7865#true} #56#return; {7865#true} is VALID [2022-04-27 10:52:47,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {7865#true} assume true; {7865#true} is VALID [2022-04-27 10:52:47,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {7865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7865#true} is VALID [2022-04-27 10:52:47,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {7865#true} call ULTIMATE.init(); {7865#true} is VALID [2022-04-27 10:52:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-04-27 10:52:47,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651211322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:52:47,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:52:47,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 58 [2022-04-27 10:52:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239847920] [2022-04-27 10:52:47,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:52:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 211 [2022-04-27 10:52:47,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:52:47,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:52:47,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:52:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-27 10:52:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:52:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-27 10:52:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 10:52:47,707 INFO L87 Difference]: Start difference. First operand 212 states and 262 transitions. Second operand has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:00,590 INFO L93 Difference]: Finished difference Result 2868 states and 4243 transitions. [2022-04-27 10:53:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-27 10:53:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 211 [2022-04-27 10:53:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 172 transitions. [2022-04-27 10:53:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 172 transitions. [2022-04-27 10:53:00,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 172 transitions. [2022-04-27 10:53:00,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:01,023 INFO L225 Difference]: With dead ends: 2868 [2022-04-27 10:53:01,023 INFO L226 Difference]: Without dead ends: 2863 [2022-04-27 10:53:01,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 417 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=332, Invalid=11878, Unknown=0, NotChecked=0, Total=12210 [2022-04-27 10:53:01,025 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 164 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 8486 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 8486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:01,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 384 Invalid, 8540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 8486 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-27 10:53:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-04-27 10:53:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 214. [2022-04-27 10:53:02,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:02,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2863 states. Second operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:02,179 INFO L74 IsIncluded]: Start isIncluded. First operand 2863 states. Second operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:02,179 INFO L87 Difference]: Start difference. First operand 2863 states. Second operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:02,393 INFO L93 Difference]: Finished difference Result 2863 states and 4238 transitions. [2022-04-27 10:53:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4238 transitions. [2022-04-27 10:53:02,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:02,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:02,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2863 states. [2022-04-27 10:53:02,397 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2863 states. [2022-04-27 10:53:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:02,594 INFO L93 Difference]: Finished difference Result 2863 states and 4238 transitions. [2022-04-27 10:53:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4238 transitions. [2022-04-27 10:53:02,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:02,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:02,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:02,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 265 transitions. [2022-04-27 10:53:02,601 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 265 transitions. Word has length 211 [2022-04-27 10:53:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:02,601 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 265 transitions. [2022-04-27 10:53:02,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2022-04-27 10:53:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-27 10:53:02,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:53:02,603 INFO L195 NwaCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:53:02,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 10:53:02,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:53:02,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:53:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:53:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -348339615, now seen corresponding path program 9 times [2022-04-27 10:53:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:53:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197187816] [2022-04-27 10:53:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:53:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:53:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:53:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:53:03,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {19703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19648#true} is VALID [2022-04-27 10:53:03,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {19648#true} assume true; {19648#true} is VALID [2022-04-27 10:53:03,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19648#true} {19648#true} #56#return; {19648#true} is VALID [2022-04-27 10:53:03,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {19648#true} call ULTIMATE.init(); {19703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:53:03,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {19703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19648#true} is VALID [2022-04-27 10:53:03,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {19648#true} assume true; {19648#true} is VALID [2022-04-27 10:53:03,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19648#true} {19648#true} #56#return; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {19648#true} call #t~ret1 := main(); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {19648#true} ~x~0 := 0;~y~0 := 50; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 68: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,797 INFO L290 TraceCheckUtils]: 70: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 87: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 97: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 98: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 99: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 101: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 102: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 103: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 104: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 105: Hoare triple {19648#true} assume ~x~0 < 50;~x~0 := 1 + ~x~0; {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 106: Hoare triple {19648#true} assume !!(~x~0 < 100); {19648#true} is VALID [2022-04-27 10:53:03,799 INFO L290 TraceCheckUtils]: 107: Hoare triple {19648#true} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19653#(<= 51 main_~x~0)} is VALID [2022-04-27 10:53:03,800 INFO L290 TraceCheckUtils]: 108: Hoare triple {19653#(<= 51 main_~x~0)} assume !!(~x~0 < 100); {19653#(<= 51 main_~x~0)} is VALID [2022-04-27 10:53:03,800 INFO L290 TraceCheckUtils]: 109: Hoare triple {19653#(<= 51 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19654#(<= 52 main_~x~0)} is VALID [2022-04-27 10:53:03,800 INFO L290 TraceCheckUtils]: 110: Hoare triple {19654#(<= 52 main_~x~0)} assume !!(~x~0 < 100); {19654#(<= 52 main_~x~0)} is VALID [2022-04-27 10:53:03,801 INFO L290 TraceCheckUtils]: 111: Hoare triple {19654#(<= 52 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19655#(<= 53 main_~x~0)} is VALID [2022-04-27 10:53:03,801 INFO L290 TraceCheckUtils]: 112: Hoare triple {19655#(<= 53 main_~x~0)} assume !!(~x~0 < 100); {19655#(<= 53 main_~x~0)} is VALID [2022-04-27 10:53:03,801 INFO L290 TraceCheckUtils]: 113: Hoare triple {19655#(<= 53 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19656#(<= 54 main_~x~0)} is VALID [2022-04-27 10:53:03,802 INFO L290 TraceCheckUtils]: 114: Hoare triple {19656#(<= 54 main_~x~0)} assume !!(~x~0 < 100); {19656#(<= 54 main_~x~0)} is VALID [2022-04-27 10:53:03,802 INFO L290 TraceCheckUtils]: 115: Hoare triple {19656#(<= 54 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19657#(<= 55 main_~x~0)} is VALID [2022-04-27 10:53:03,802 INFO L290 TraceCheckUtils]: 116: Hoare triple {19657#(<= 55 main_~x~0)} assume !!(~x~0 < 100); {19657#(<= 55 main_~x~0)} is VALID [2022-04-27 10:53:03,802 INFO L290 TraceCheckUtils]: 117: Hoare triple {19657#(<= 55 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19658#(<= 56 main_~x~0)} is VALID [2022-04-27 10:53:03,803 INFO L290 TraceCheckUtils]: 118: Hoare triple {19658#(<= 56 main_~x~0)} assume !!(~x~0 < 100); {19658#(<= 56 main_~x~0)} is VALID [2022-04-27 10:53:03,803 INFO L290 TraceCheckUtils]: 119: Hoare triple {19658#(<= 56 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19659#(<= 57 main_~x~0)} is VALID [2022-04-27 10:53:03,803 INFO L290 TraceCheckUtils]: 120: Hoare triple {19659#(<= 57 main_~x~0)} assume !!(~x~0 < 100); {19659#(<= 57 main_~x~0)} is VALID [2022-04-27 10:53:03,804 INFO L290 TraceCheckUtils]: 121: Hoare triple {19659#(<= 57 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19660#(<= 58 main_~x~0)} is VALID [2022-04-27 10:53:03,804 INFO L290 TraceCheckUtils]: 122: Hoare triple {19660#(<= 58 main_~x~0)} assume !!(~x~0 < 100); {19660#(<= 58 main_~x~0)} is VALID [2022-04-27 10:53:03,804 INFO L290 TraceCheckUtils]: 123: Hoare triple {19660#(<= 58 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19661#(<= 59 main_~x~0)} is VALID [2022-04-27 10:53:03,805 INFO L290 TraceCheckUtils]: 124: Hoare triple {19661#(<= 59 main_~x~0)} assume !!(~x~0 < 100); {19661#(<= 59 main_~x~0)} is VALID [2022-04-27 10:53:03,805 INFO L290 TraceCheckUtils]: 125: Hoare triple {19661#(<= 59 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19662#(<= 60 main_~x~0)} is VALID [2022-04-27 10:53:03,805 INFO L290 TraceCheckUtils]: 126: Hoare triple {19662#(<= 60 main_~x~0)} assume !!(~x~0 < 100); {19662#(<= 60 main_~x~0)} is VALID [2022-04-27 10:53:03,805 INFO L290 TraceCheckUtils]: 127: Hoare triple {19662#(<= 60 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19663#(<= 61 main_~x~0)} is VALID [2022-04-27 10:53:03,813 INFO L290 TraceCheckUtils]: 128: Hoare triple {19663#(<= 61 main_~x~0)} assume !!(~x~0 < 100); {19663#(<= 61 main_~x~0)} is VALID [2022-04-27 10:53:03,813 INFO L290 TraceCheckUtils]: 129: Hoare triple {19663#(<= 61 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19664#(<= 62 main_~x~0)} is VALID [2022-04-27 10:53:03,814 INFO L290 TraceCheckUtils]: 130: Hoare triple {19664#(<= 62 main_~x~0)} assume !!(~x~0 < 100); {19664#(<= 62 main_~x~0)} is VALID [2022-04-27 10:53:03,814 INFO L290 TraceCheckUtils]: 131: Hoare triple {19664#(<= 62 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19665#(<= 63 main_~x~0)} is VALID [2022-04-27 10:53:03,814 INFO L290 TraceCheckUtils]: 132: Hoare triple {19665#(<= 63 main_~x~0)} assume !!(~x~0 < 100); {19665#(<= 63 main_~x~0)} is VALID [2022-04-27 10:53:03,815 INFO L290 TraceCheckUtils]: 133: Hoare triple {19665#(<= 63 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19666#(<= 64 main_~x~0)} is VALID [2022-04-27 10:53:03,815 INFO L290 TraceCheckUtils]: 134: Hoare triple {19666#(<= 64 main_~x~0)} assume !!(~x~0 < 100); {19666#(<= 64 main_~x~0)} is VALID [2022-04-27 10:53:03,815 INFO L290 TraceCheckUtils]: 135: Hoare triple {19666#(<= 64 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19667#(<= 65 main_~x~0)} is VALID [2022-04-27 10:53:03,815 INFO L290 TraceCheckUtils]: 136: Hoare triple {19667#(<= 65 main_~x~0)} assume !!(~x~0 < 100); {19667#(<= 65 main_~x~0)} is VALID [2022-04-27 10:53:03,816 INFO L290 TraceCheckUtils]: 137: Hoare triple {19667#(<= 65 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19668#(<= 66 main_~x~0)} is VALID [2022-04-27 10:53:03,816 INFO L290 TraceCheckUtils]: 138: Hoare triple {19668#(<= 66 main_~x~0)} assume !!(~x~0 < 100); {19668#(<= 66 main_~x~0)} is VALID [2022-04-27 10:53:03,816 INFO L290 TraceCheckUtils]: 139: Hoare triple {19668#(<= 66 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19669#(<= 67 main_~x~0)} is VALID [2022-04-27 10:53:03,817 INFO L290 TraceCheckUtils]: 140: Hoare triple {19669#(<= 67 main_~x~0)} assume !!(~x~0 < 100); {19669#(<= 67 main_~x~0)} is VALID [2022-04-27 10:53:03,817 INFO L290 TraceCheckUtils]: 141: Hoare triple {19669#(<= 67 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19670#(<= 68 main_~x~0)} is VALID [2022-04-27 10:53:03,817 INFO L290 TraceCheckUtils]: 142: Hoare triple {19670#(<= 68 main_~x~0)} assume !!(~x~0 < 100); {19670#(<= 68 main_~x~0)} is VALID [2022-04-27 10:53:03,818 INFO L290 TraceCheckUtils]: 143: Hoare triple {19670#(<= 68 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19671#(<= 69 main_~x~0)} is VALID [2022-04-27 10:53:03,818 INFO L290 TraceCheckUtils]: 144: Hoare triple {19671#(<= 69 main_~x~0)} assume !!(~x~0 < 100); {19671#(<= 69 main_~x~0)} is VALID [2022-04-27 10:53:03,818 INFO L290 TraceCheckUtils]: 145: Hoare triple {19671#(<= 69 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19672#(<= 70 main_~x~0)} is VALID [2022-04-27 10:53:03,818 INFO L290 TraceCheckUtils]: 146: Hoare triple {19672#(<= 70 main_~x~0)} assume !!(~x~0 < 100); {19672#(<= 70 main_~x~0)} is VALID [2022-04-27 10:53:03,819 INFO L290 TraceCheckUtils]: 147: Hoare triple {19672#(<= 70 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19673#(<= 71 main_~x~0)} is VALID [2022-04-27 10:53:03,819 INFO L290 TraceCheckUtils]: 148: Hoare triple {19673#(<= 71 main_~x~0)} assume !!(~x~0 < 100); {19673#(<= 71 main_~x~0)} is VALID [2022-04-27 10:53:03,819 INFO L290 TraceCheckUtils]: 149: Hoare triple {19673#(<= 71 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19674#(<= 72 main_~x~0)} is VALID [2022-04-27 10:53:03,820 INFO L290 TraceCheckUtils]: 150: Hoare triple {19674#(<= 72 main_~x~0)} assume !!(~x~0 < 100); {19674#(<= 72 main_~x~0)} is VALID [2022-04-27 10:53:03,820 INFO L290 TraceCheckUtils]: 151: Hoare triple {19674#(<= 72 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19675#(<= 73 main_~x~0)} is VALID [2022-04-27 10:53:03,820 INFO L290 TraceCheckUtils]: 152: Hoare triple {19675#(<= 73 main_~x~0)} assume !!(~x~0 < 100); {19675#(<= 73 main_~x~0)} is VALID [2022-04-27 10:53:03,820 INFO L290 TraceCheckUtils]: 153: Hoare triple {19675#(<= 73 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19676#(<= 74 main_~x~0)} is VALID [2022-04-27 10:53:03,821 INFO L290 TraceCheckUtils]: 154: Hoare triple {19676#(<= 74 main_~x~0)} assume !!(~x~0 < 100); {19676#(<= 74 main_~x~0)} is VALID [2022-04-27 10:53:03,821 INFO L290 TraceCheckUtils]: 155: Hoare triple {19676#(<= 74 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19677#(<= 75 main_~x~0)} is VALID [2022-04-27 10:53:03,821 INFO L290 TraceCheckUtils]: 156: Hoare triple {19677#(<= 75 main_~x~0)} assume !!(~x~0 < 100); {19677#(<= 75 main_~x~0)} is VALID [2022-04-27 10:53:03,822 INFO L290 TraceCheckUtils]: 157: Hoare triple {19677#(<= 75 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19678#(<= 76 main_~x~0)} is VALID [2022-04-27 10:53:03,822 INFO L290 TraceCheckUtils]: 158: Hoare triple {19678#(<= 76 main_~x~0)} assume !!(~x~0 < 100); {19678#(<= 76 main_~x~0)} is VALID [2022-04-27 10:53:03,822 INFO L290 TraceCheckUtils]: 159: Hoare triple {19678#(<= 76 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19679#(<= 77 main_~x~0)} is VALID [2022-04-27 10:53:03,823 INFO L290 TraceCheckUtils]: 160: Hoare triple {19679#(<= 77 main_~x~0)} assume !!(~x~0 < 100); {19679#(<= 77 main_~x~0)} is VALID [2022-04-27 10:53:03,823 INFO L290 TraceCheckUtils]: 161: Hoare triple {19679#(<= 77 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19680#(<= 78 main_~x~0)} is VALID [2022-04-27 10:53:03,823 INFO L290 TraceCheckUtils]: 162: Hoare triple {19680#(<= 78 main_~x~0)} assume !!(~x~0 < 100); {19680#(<= 78 main_~x~0)} is VALID [2022-04-27 10:53:03,823 INFO L290 TraceCheckUtils]: 163: Hoare triple {19680#(<= 78 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19681#(<= 79 main_~x~0)} is VALID [2022-04-27 10:53:03,824 INFO L290 TraceCheckUtils]: 164: Hoare triple {19681#(<= 79 main_~x~0)} assume !!(~x~0 < 100); {19681#(<= 79 main_~x~0)} is VALID [2022-04-27 10:53:03,824 INFO L290 TraceCheckUtils]: 165: Hoare triple {19681#(<= 79 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19682#(<= 80 main_~x~0)} is VALID [2022-04-27 10:53:03,824 INFO L290 TraceCheckUtils]: 166: Hoare triple {19682#(<= 80 main_~x~0)} assume !!(~x~0 < 100); {19682#(<= 80 main_~x~0)} is VALID [2022-04-27 10:53:03,825 INFO L290 TraceCheckUtils]: 167: Hoare triple {19682#(<= 80 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19683#(<= 81 main_~x~0)} is VALID [2022-04-27 10:53:03,825 INFO L290 TraceCheckUtils]: 168: Hoare triple {19683#(<= 81 main_~x~0)} assume !!(~x~0 < 100); {19683#(<= 81 main_~x~0)} is VALID [2022-04-27 10:53:03,825 INFO L290 TraceCheckUtils]: 169: Hoare triple {19683#(<= 81 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19684#(<= 82 main_~x~0)} is VALID [2022-04-27 10:53:03,825 INFO L290 TraceCheckUtils]: 170: Hoare triple {19684#(<= 82 main_~x~0)} assume !!(~x~0 < 100); {19684#(<= 82 main_~x~0)} is VALID [2022-04-27 10:53:03,826 INFO L290 TraceCheckUtils]: 171: Hoare triple {19684#(<= 82 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19685#(<= 83 main_~x~0)} is VALID [2022-04-27 10:53:03,826 INFO L290 TraceCheckUtils]: 172: Hoare triple {19685#(<= 83 main_~x~0)} assume !!(~x~0 < 100); {19685#(<= 83 main_~x~0)} is VALID [2022-04-27 10:53:03,826 INFO L290 TraceCheckUtils]: 173: Hoare triple {19685#(<= 83 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19686#(<= 84 main_~x~0)} is VALID [2022-04-27 10:53:03,827 INFO L290 TraceCheckUtils]: 174: Hoare triple {19686#(<= 84 main_~x~0)} assume !!(~x~0 < 100); {19686#(<= 84 main_~x~0)} is VALID [2022-04-27 10:53:03,827 INFO L290 TraceCheckUtils]: 175: Hoare triple {19686#(<= 84 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19687#(<= 85 main_~x~0)} is VALID [2022-04-27 10:53:03,827 INFO L290 TraceCheckUtils]: 176: Hoare triple {19687#(<= 85 main_~x~0)} assume !!(~x~0 < 100); {19687#(<= 85 main_~x~0)} is VALID [2022-04-27 10:53:03,828 INFO L290 TraceCheckUtils]: 177: Hoare triple {19687#(<= 85 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19688#(<= 86 main_~x~0)} is VALID [2022-04-27 10:53:03,828 INFO L290 TraceCheckUtils]: 178: Hoare triple {19688#(<= 86 main_~x~0)} assume !!(~x~0 < 100); {19688#(<= 86 main_~x~0)} is VALID [2022-04-27 10:53:03,828 INFO L290 TraceCheckUtils]: 179: Hoare triple {19688#(<= 86 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19689#(<= 87 main_~x~0)} is VALID [2022-04-27 10:53:03,828 INFO L290 TraceCheckUtils]: 180: Hoare triple {19689#(<= 87 main_~x~0)} assume !!(~x~0 < 100); {19689#(<= 87 main_~x~0)} is VALID [2022-04-27 10:53:03,829 INFO L290 TraceCheckUtils]: 181: Hoare triple {19689#(<= 87 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19690#(<= 88 main_~x~0)} is VALID [2022-04-27 10:53:03,829 INFO L290 TraceCheckUtils]: 182: Hoare triple {19690#(<= 88 main_~x~0)} assume !!(~x~0 < 100); {19690#(<= 88 main_~x~0)} is VALID [2022-04-27 10:53:03,829 INFO L290 TraceCheckUtils]: 183: Hoare triple {19690#(<= 88 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19691#(<= 89 main_~x~0)} is VALID [2022-04-27 10:53:03,830 INFO L290 TraceCheckUtils]: 184: Hoare triple {19691#(<= 89 main_~x~0)} assume !!(~x~0 < 100); {19691#(<= 89 main_~x~0)} is VALID [2022-04-27 10:53:03,830 INFO L290 TraceCheckUtils]: 185: Hoare triple {19691#(<= 89 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19692#(<= 90 main_~x~0)} is VALID [2022-04-27 10:53:03,830 INFO L290 TraceCheckUtils]: 186: Hoare triple {19692#(<= 90 main_~x~0)} assume !!(~x~0 < 100); {19692#(<= 90 main_~x~0)} is VALID [2022-04-27 10:53:03,831 INFO L290 TraceCheckUtils]: 187: Hoare triple {19692#(<= 90 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19693#(<= 91 main_~x~0)} is VALID [2022-04-27 10:53:03,831 INFO L290 TraceCheckUtils]: 188: Hoare triple {19693#(<= 91 main_~x~0)} assume !!(~x~0 < 100); {19693#(<= 91 main_~x~0)} is VALID [2022-04-27 10:53:03,831 INFO L290 TraceCheckUtils]: 189: Hoare triple {19693#(<= 91 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19694#(<= 92 main_~x~0)} is VALID [2022-04-27 10:53:03,831 INFO L290 TraceCheckUtils]: 190: Hoare triple {19694#(<= 92 main_~x~0)} assume !!(~x~0 < 100); {19694#(<= 92 main_~x~0)} is VALID [2022-04-27 10:53:03,832 INFO L290 TraceCheckUtils]: 191: Hoare triple {19694#(<= 92 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19695#(<= 93 main_~x~0)} is VALID [2022-04-27 10:53:03,832 INFO L290 TraceCheckUtils]: 192: Hoare triple {19695#(<= 93 main_~x~0)} assume !!(~x~0 < 100); {19695#(<= 93 main_~x~0)} is VALID [2022-04-27 10:53:03,832 INFO L290 TraceCheckUtils]: 193: Hoare triple {19695#(<= 93 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19696#(<= 94 main_~x~0)} is VALID [2022-04-27 10:53:03,833 INFO L290 TraceCheckUtils]: 194: Hoare triple {19696#(<= 94 main_~x~0)} assume !!(~x~0 < 100); {19696#(<= 94 main_~x~0)} is VALID [2022-04-27 10:53:03,833 INFO L290 TraceCheckUtils]: 195: Hoare triple {19696#(<= 94 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19697#(<= 95 main_~x~0)} is VALID [2022-04-27 10:53:03,833 INFO L290 TraceCheckUtils]: 196: Hoare triple {19697#(<= 95 main_~x~0)} assume !!(~x~0 < 100); {19697#(<= 95 main_~x~0)} is VALID [2022-04-27 10:53:03,834 INFO L290 TraceCheckUtils]: 197: Hoare triple {19697#(<= 95 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19698#(<= 96 main_~x~0)} is VALID [2022-04-27 10:53:03,834 INFO L290 TraceCheckUtils]: 198: Hoare triple {19698#(<= 96 main_~x~0)} assume !!(~x~0 < 100); {19698#(<= 96 main_~x~0)} is VALID [2022-04-27 10:53:03,834 INFO L290 TraceCheckUtils]: 199: Hoare triple {19698#(<= 96 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19699#(<= 97 main_~x~0)} is VALID [2022-04-27 10:53:03,834 INFO L290 TraceCheckUtils]: 200: Hoare triple {19699#(<= 97 main_~x~0)} assume !!(~x~0 < 100); {19699#(<= 97 main_~x~0)} is VALID [2022-04-27 10:53:03,835 INFO L290 TraceCheckUtils]: 201: Hoare triple {19699#(<= 97 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19700#(<= 98 main_~x~0)} is VALID [2022-04-27 10:53:03,835 INFO L290 TraceCheckUtils]: 202: Hoare triple {19700#(<= 98 main_~x~0)} assume !!(~x~0 < 100); {19700#(<= 98 main_~x~0)} is VALID [2022-04-27 10:53:03,840 INFO L290 TraceCheckUtils]: 203: Hoare triple {19700#(<= 98 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19701#(<= 99 main_~x~0)} is VALID [2022-04-27 10:53:03,843 INFO L290 TraceCheckUtils]: 204: Hoare triple {19701#(<= 99 main_~x~0)} assume !!(~x~0 < 100); {19701#(<= 99 main_~x~0)} is VALID [2022-04-27 10:53:03,843 INFO L290 TraceCheckUtils]: 205: Hoare triple {19701#(<= 99 main_~x~0)} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19702#(<= 100 main_~x~0)} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 206: Hoare triple {19702#(<= 100 main_~x~0)} assume !!(~x~0 < 100); {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 207: Hoare triple {19649#false} assume !(~x~0 < 50);~x~0 := 1 + ~x~0;~y~0 := 1 + ~y~0; {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 208: Hoare triple {19649#false} assume !(~x~0 < 100); {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L272 TraceCheckUtils]: 209: Hoare triple {19649#false} call __VERIFIER_assert((if 100 == ~y~0 then 1 else 0)); {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 210: Hoare triple {19649#false} ~cond := #in~cond; {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 211: Hoare triple {19649#false} assume 0 == ~cond; {19649#false} is VALID [2022-04-27 10:53:03,844 INFO L290 TraceCheckUtils]: 212: Hoare triple {19649#false} assume !false; {19649#false} is VALID [2022-04-27 10:53:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-04-27 10:53:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:53:03,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197187816] [2022-04-27 10:53:03,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197187816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:53:03,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:53:03,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-27 10:53:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486849058] [2022-04-27 10:53:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:53:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 213 [2022-04-27 10:53:03,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:53:03,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:03,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:03,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-27 10:53:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:53:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-27 10:53:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-04-27 10:53:03,912 INFO L87 Difference]: Start difference. First operand 214 states and 265 transitions. Second operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:06,261 INFO L93 Difference]: Finished difference Result 313 states and 413 transitions. [2022-04-27 10:53:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-27 10:53:06,261 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 213 [2022-04-27 10:53:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:53:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 165 transitions. [2022-04-27 10:53:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 165 transitions. [2022-04-27 10:53:06,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 165 transitions. [2022-04-27 10:53:06,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:53:06,407 INFO L225 Difference]: With dead ends: 313 [2022-04-27 10:53:06,407 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:53:06,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2022-04-27 10:53:06,411 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:53:06,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:53:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:53:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:53:06,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:53:06,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:06,411 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:06,411 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:06,411 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:06,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:06,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:53:06,412 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:53:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:53:06,412 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:53:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:06,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:06,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:53:06,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:53:06,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:53:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:53:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:53:06,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2022-04-27 10:53:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:53:06,412 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:53:06,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:53:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:53:06,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:53:06,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:53:06,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:53:06,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:53:14,395 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:53:14,395 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:53:14,395 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 33) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 27 34) the Hoare annotation is: (or (and (<= main_~y~0 69) (<= 69 main_~y~0) (< main_~x~0 70) (<= 69 main_~x~0)) (and (< main_~x~0 76) (<= 75 main_~y~0) (<= 75 main_~x~0) (<= main_~y~0 75)) (and (<= 80 main_~x~0) (<= main_~y~0 80) (< main_~x~0 81) (<= 80 main_~y~0)) (and (<= 58 main_~x~0) (<= main_~x~0 58) (<= 58 main_~y~0) (<= main_~y~0 58)) (and (< main_~x~0 89) (<= main_~y~0 88) (<= 88 main_~y~0) (<= 88 main_~x~0)) (and (< main_~x~0 85) (<= 84 main_~x~0) (<= main_~y~0 84) (<= 84 main_~y~0)) (and (<= 77 main_~y~0) (< main_~x~0 78) (<= main_~y~0 77) (<= 77 main_~x~0)) (and (<= 66 main_~y~0) (<= main_~y~0 66) (<= 66 main_~x~0) (< main_~x~0 67)) (and (< main_~x~0 97) (<= 96 main_~y~0) (<= 96 main_~x~0) (<= main_~y~0 96)) (and (<= 74 main_~x~0) (<= 74 main_~y~0) (<= main_~y~0 74) (< main_~x~0 75)) (and (< main_~x~0 77) (<= 76 main_~x~0) (<= main_~y~0 76) (<= 76 main_~y~0)) (and (< main_~x~0 94) (<= 93 main_~y~0) (<= main_~y~0 93) (<= 93 main_~x~0)) (and (<= main_~y~0 53) (<= 53 main_~x~0) (<= 53 main_~y~0) (<= main_~x~0 53)) (and (<= 78 main_~y~0) (<= 78 main_~x~0) (< main_~x~0 79) (<= main_~y~0 78)) (and (<= 92 main_~y~0) (<= 92 main_~x~0) (<= main_~y~0 92) (< main_~x~0 93)) (and (<= main_~y~0 56) (<= main_~x~0 56) (<= 56 main_~x~0) (<= 56 main_~y~0)) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= 51 main_~x~0) (<= main_~y~0 51)) (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= 90 main_~x~0) (< main_~x~0 91)) (and (<= 70 main_~x~0) (<= 70 main_~y~0) (<= main_~y~0 70) (< main_~x~0 71)) (and (<= main_~y~0 68) (<= 68 main_~y~0) (<= 68 main_~x~0) (< main_~x~0 69)) (and (<= main_~x~0 55) (<= 55 main_~y~0) (<= main_~y~0 55) (<= 55 main_~x~0)) (and (<= 81 main_~x~0) (<= main_~y~0 81) (< main_~x~0 82) (<= 81 main_~y~0)) (and (<= main_~x~0 63) (<= 63 main_~x~0) (<= 63 main_~y~0) (<= main_~y~0 63)) (and (<= 65 main_~y~0) (<= main_~y~0 65) (<= 65 main_~x~0) (< main_~x~0 66)) (and (<= main_~x~0 60) (<= 60 main_~y~0) (<= main_~y~0 60) (<= 60 main_~x~0)) (and (<= 97 main_~y~0) (< main_~x~0 98) (<= 97 main_~x~0) (<= main_~y~0 97)) (and (<= main_~y~0 85) (<= 85 main_~x~0) (<= 85 main_~y~0) (< main_~x~0 86)) (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~x~0) (<= 59 main_~y~0)) (and (<= 86 main_~y~0) (< main_~x~0 87) (<= 86 main_~x~0) (<= main_~y~0 86)) (and (<= 54 main_~y~0) (<= main_~x~0 54) (<= 54 main_~x~0) (<= main_~y~0 54)) (and (<= main_~y~0 72) (< main_~x~0 73) (<= 72 main_~x~0) (<= 72 main_~y~0)) (and (<= 91 main_~y~0) (<= main_~y~0 91) (<= 91 main_~x~0) (< main_~x~0 92)) (and (<= main_~y~0 52) (<= main_~x~0 52) (<= 52 main_~x~0) (<= 52 main_~y~0)) (and (<= 62 main_~x~0) (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0)) (and (<= main_~y~0 57) (<= 57 main_~x~0) (<= 57 main_~y~0) (<= main_~x~0 57)) (and (<= main_~y~0 71) (<= 71 main_~y~0) (< main_~x~0 72) (<= 71 main_~x~0)) (and (<= 79 main_~x~0) (< main_~x~0 80) (<= main_~y~0 79) (<= 79 main_~y~0)) (and (<= main_~x~0 61) (<= main_~y~0 61) (<= 61 main_~x~0) (<= 61 main_~y~0)) (and (< main_~x~0 100) (<= 99 main_~x~0) (<= main_~y~0 99) (<= 99 main_~y~0)) (and (<= 64 main_~y~0) (<= main_~y~0 64) (<= main_~x~0 64) (<= 64 main_~x~0)) (and (<= main_~y~0 73) (<= 73 main_~x~0) (< main_~x~0 74) (<= 73 main_~y~0)) (and (<= 82 main_~x~0) (<= 82 main_~y~0) (<= main_~y~0 82) (< main_~x~0 83)) (and (<= main_~y~0 94) (<= 94 main_~x~0) (<= 94 main_~y~0) (< main_~x~0 95)) (and (<= 50 main_~y~0) (<= main_~x~0 50) (<= main_~y~0 50)) (and (< main_~x~0 99) (<= 98 main_~y~0) (<= 98 main_~x~0) (<= main_~y~0 98)) (and (<= 83 main_~x~0) (< main_~x~0 84) (<= 83 main_~y~0) (<= main_~y~0 83)) (and (< main_~x~0 88) (<= main_~y~0 87) (<= 87 main_~x~0) (<= 87 main_~y~0)) (and (<= main_~y~0 67) (<= 67 main_~x~0) (<= 67 main_~y~0) (< main_~x~0 68)) (and (< 99 main_~y~0) (<= 100 main_~x~0) (<= main_~y~0 100)) (and (<= 95 main_~x~0) (< main_~x~0 96) (<= 95 main_~y~0) (<= main_~y~0 95)) (and (<= main_~y~0 89) (<= 89 main_~y~0) (<= 89 main_~x~0) (< main_~x~0 90))) [2022-04-27 10:53:14,396 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 34) the Hoare annotation is: (and (< 99 main_~y~0) (<= main_~y~0 100)) [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 37) no Hoare annotation was computed. [2022-04-27 10:53:14,396 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:53:14,397 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:53:14,397 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:53:14,399 INFO L356 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2022-04-27 10:53:14,400 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:53:14,402 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:14,402 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:53:14,402 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:14,403 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:14,405 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:53:14,511 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:53:14,512 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:53:14,512 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:53:14,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:53:14 BoogieIcfgContainer [2022-04-27 10:53:14,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:53:14,528 INFO L158 Benchmark]: Toolchain (without parser) took 58183.58ms. Allocated memory was 255.9MB in the beginning and 407.9MB in the end (delta: 152.0MB). Free memory was 199.4MB in the beginning and 208.4MB in the end (delta: -9.1MB). Peak memory consumption was 219.8MB. Max. memory is 8.0GB. [2022-04-27 10:53:14,528 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 215.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:53:14,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.06ms. Allocated memory was 255.9MB in the beginning and 407.9MB in the end (delta: 152.0MB). Free memory was 199.2MB in the beginning and 378.2MB in the end (delta: -179.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-04-27 10:53:14,528 INFO L158 Benchmark]: Boogie Preprocessor took 18.63ms. Allocated memory is still 407.9MB. Free memory was 378.2MB in the beginning and 376.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:53:14,528 INFO L158 Benchmark]: RCFGBuilder took 204.96ms. Allocated memory is still 407.9MB. Free memory was 376.6MB in the beginning and 365.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:53:14,529 INFO L158 Benchmark]: TraceAbstraction took 57741.26ms. Allocated memory is still 407.9MB. Free memory was 365.1MB in the beginning and 208.4MB in the end (delta: 156.6MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. [2022-04-27 10:53:14,529 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 215.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.06ms. Allocated memory was 255.9MB in the beginning and 407.9MB in the end (delta: 152.0MB). Free memory was 199.2MB in the beginning and 378.2MB in the end (delta: -179.0MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.63ms. Allocated memory is still 407.9MB. Free memory was 378.2MB in the beginning and 376.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 204.96ms. Allocated memory is still 407.9MB. Free memory was 376.6MB in the beginning and 365.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 57741.26ms. Allocated memory is still 407.9MB. Free memory was 365.1MB in the beginning and 208.4MB in the end (delta: 156.6MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 12, TraceHistogramMax: 101, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 770 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 1116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9831 IncrementalHoareTripleChecker+Invalid, 10947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1116 mSolverCounterUnsat, 245 mSDtfsCounter, 9831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2233 GetRequests, 1415 SyntacticMatches, 8 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13368 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=11, InterpolantAutomatonStates: 431, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 2649 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 120 NumberOfFragments, 676 HoareAnnotationTreeSize, 18 FomulaSimplifications, 2460 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13500 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1583 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 2350 ConstructedInterpolants, 0 QuantifiedInterpolants, 8130 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1685 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 26464/68563 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((y <= 69 && 69 <= y) && x < 70) && 69 <= x) || (((x < 76 && 75 <= y) && 75 <= x) && y <= 75)) || (((80 <= x && y <= 80) && x < 81) && 80 <= y)) || (((58 <= x && x <= 58) && 58 <= y) && y <= 58)) || (((x < 89 && y <= 88) && 88 <= y) && 88 <= x)) || (((x < 85 && 84 <= x) && y <= 84) && 84 <= y)) || (((77 <= y && x < 78) && y <= 77) && 77 <= x)) || (((66 <= y && y <= 66) && 66 <= x) && x < 67)) || (((x < 97 && 96 <= y) && 96 <= x) && y <= 96)) || (((74 <= x && 74 <= y) && y <= 74) && x < 75)) || (((x < 77 && 76 <= x) && y <= 76) && 76 <= y)) || (((x < 94 && 93 <= y) && y <= 93) && 93 <= x)) || (((y <= 53 && 53 <= x) && 53 <= y) && x <= 53)) || (((78 <= y && 78 <= x) && x < 79) && y <= 78)) || (((92 <= y && 92 <= x) && y <= 92) && x < 93)) || (((y <= 56 && x <= 56) && 56 <= x) && 56 <= y)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((90 <= y && y <= 90) && 90 <= x) && x < 91)) || (((70 <= x && 70 <= y) && y <= 70) && x < 71)) || (((y <= 68 && 68 <= y) && 68 <= x) && x < 69)) || (((x <= 55 && 55 <= y) && y <= 55) && 55 <= x)) || (((81 <= x && y <= 81) && x < 82) && 81 <= y)) || (((x <= 63 && 63 <= x) && 63 <= y) && y <= 63)) || (((65 <= y && y <= 65) && 65 <= x) && x < 66)) || (((x <= 60 && 60 <= y) && y <= 60) && 60 <= x)) || (((97 <= y && x < 98) && 97 <= x) && y <= 97)) || (((y <= 85 && 85 <= x) && 85 <= y) && x < 86)) || (((y <= 59 && x <= 59) && 59 <= x) && 59 <= y)) || (((86 <= y && x < 87) && 86 <= x) && y <= 86)) || (((54 <= y && x <= 54) && 54 <= x) && y <= 54)) || (((y <= 72 && x < 73) && 72 <= x) && 72 <= y)) || (((91 <= y && y <= 91) && 91 <= x) && x < 92)) || (((y <= 52 && x <= 52) && 52 <= x) && 52 <= y)) || (((62 <= x && y <= 62) && x <= 62) && 62 <= y)) || (((y <= 57 && 57 <= x) && 57 <= y) && x <= 57)) || (((y <= 71 && 71 <= y) && x < 72) && 71 <= x)) || (((79 <= x && x < 80) && y <= 79) && 79 <= y)) || (((x <= 61 && y <= 61) && 61 <= x) && 61 <= y)) || (((x < 100 && 99 <= x) && y <= 99) && 99 <= y)) || (((64 <= y && y <= 64) && x <= 64) && 64 <= x)) || (((y <= 73 && 73 <= x) && x < 74) && 73 <= y)) || (((82 <= x && 82 <= y) && y <= 82) && x < 83)) || (((y <= 94 && 94 <= x) && 94 <= y) && x < 95)) || ((50 <= y && x <= 50) && y <= 50)) || (((x < 99 && 98 <= y) && 98 <= x) && y <= 98)) || (((83 <= x && x < 84) && 83 <= y) && y <= 83)) || (((x < 88 && y <= 87) && 87 <= x) && 87 <= y)) || (((y <= 67 && 67 <= x) && 67 <= y) && x < 68)) || ((99 < y && 100 <= x) && y <= 100)) || (((95 <= x && x < 96) && 95 <= y) && y <= 95)) || (((y <= 89 && 89 <= y) && 89 <= x) && x < 90) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:53:14,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...