/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/afnp2014.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:32:05,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:32:05,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:32:05,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:32:05,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:32:05,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:32:05,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:32:05,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:32:05,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:32:05,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:32:05,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:32:05,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:32:05,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:32:05,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:32:05,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:32:05,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:32:05,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:32:05,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:32:05,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:32:05,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:32:05,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:32:05,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:32:05,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:32:05,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:32:05,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:32:05,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:32:05,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:32:05,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:32:05,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:32:05,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:32:05,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:32:05,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:32:05,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:32:05,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:32:05,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:32:05,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:32:05,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:32:05,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:32:05,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:32:05,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:32:05,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:32:05,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:32:05,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:32:05,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:32:05,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:32:05,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:32:05,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:32:05,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:32:05,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:32:05,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:32:05,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:32:05,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:32:05,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:32:05,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:32:05,870 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:32:05,871 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:32:05,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:32:05,871 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:32:05,871 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 09:32:06,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:32:06,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:32:06,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:32:06,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:32:06,135 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:32:06,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-08 09:32:06,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998523c67/667d1174e20e43f58c944cd8b3e9a490/FLAG5d69fc992 [2022-04-08 09:32:06,557 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:32:06,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-08 09:32:06,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998523c67/667d1174e20e43f58c944cd8b3e9a490/FLAG5d69fc992 [2022-04-08 09:32:06,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998523c67/667d1174e20e43f58c944cd8b3e9a490 [2022-04-08 09:32:06,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:32:06,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:32:06,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:32:06,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:32:06,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:32:06,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3464533d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06, skipping insertion in model container [2022-04-08 09:32:06,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:32:06,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:32:06,759 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/afnp2014.i[895,908] [2022-04-08 09:32:06,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:32:06,783 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:32:06,793 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/afnp2014.i[895,908] [2022-04-08 09:32:06,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:32:06,806 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:32:06,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06 WrapperNode [2022-04-08 09:32:06,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:32:06,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:32:06,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:32:06,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:32:06,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:32:06,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:32:06,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:32:06,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:32:06,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (1/1) ... [2022-04-08 09:32:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:32:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:06,859 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-08 09:32:06,880 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-08 09:32:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:32:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:32:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:32:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:32:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:32:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:32:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:32:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:32:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:32:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:32:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:32:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:32:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:32:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:32:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:32:06,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:32:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:32:06,964 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:32:06,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:32:07,085 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:32:07,089 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:32:07,089 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:32:07,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:32:07 BoogieIcfgContainer [2022-04-08 09:32:07,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:32:07,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:32:07,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:32:07,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:32:07,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:32:06" (1/3) ... [2022-04-08 09:32:07,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a82a7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:32:07, skipping insertion in model container [2022-04-08 09:32:07,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:32:06" (2/3) ... [2022-04-08 09:32:07,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a82a7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:32:07, skipping insertion in model container [2022-04-08 09:32:07,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:32:07" (3/3) ... [2022-04-08 09:32:07,096 INFO L111 eAbstractionObserver]: Analyzing ICFG afnp2014.i [2022-04-08 09:32:07,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:32:07,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:32:07,126 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:32:07,131 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 09:32:07,131 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:32:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-08 09:32:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:32:07,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:07,154 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:07,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1411659294, now seen corresponding path program 1 times [2022-04-08 09:32:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:07,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275651305] [2022-04-08 09:32:07,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:32:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1411659294, now seen corresponding path program 2 times [2022-04-08 09:32:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:07,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877210176] [2022-04-08 09:32:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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); {24#true} is VALID [2022-04-08 09:32:07,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:32:07,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #57#return; {24#true} is VALID [2022-04-08 09:32:07,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:07,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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); {24#true} is VALID [2022-04-08 09:32:07,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 09:32:07,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #57#return; {24#true} is VALID [2022-04-08 09:32:07,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-08 09:32:07,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 1;~y~0 := 0; {24#true} is VALID [2022-04-08 09:32:07,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-08 09:32:07,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-08 09:32:07,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 09:32:07,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 09:32:07,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 09:32:07,379 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-08 09:32:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:07,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877210176] [2022-04-08 09:32:07,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877210176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:07,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:07,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:32:07,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:07,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275651305] [2022-04-08 09:32:07,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275651305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:07,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:07,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:32:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530964255] [2022-04-08 09:32:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:07,389 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-08 09:32:07,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:07,392 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-08 09:32:07,406 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-08 09:32:07,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:32:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:32:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:32:07,424 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-08 09:32:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,496 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 09:32:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:32:07,496 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-08 09:32:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:07,498 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-08 09:32:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 09:32:07,505 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-08 09:32:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 09:32:07,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-08 09:32:07,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:07,548 INFO L225 Difference]: With dead ends: 33 [2022-04-08 09:32:07,548 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:32:07,550 INFO L912 BasicCegarLoop]: 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-08 09:32:07,552 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-08 09:32:07,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:32:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:32:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:32:07,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:07,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 09:32:07,570 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 09:32:07,570 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 09:32:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,572 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:32:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:32:07,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:07,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:07,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-08 09:32:07,573 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-08 09:32:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,574 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:32:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:32:07,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:07,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:07,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:07,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 09:32:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 09:32:07,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 09:32:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:07,577 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 09:32:07,577 INFO L479 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-08 09:32:07,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 09:32:07,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:32:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:32:07,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:07,592 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:07,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:32:07,592 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1052240059, now seen corresponding path program 1 times [2022-04-08 09:32:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310708072] [2022-04-08 09:32:07,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:32:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1052240059, now seen corresponding path program 2 times [2022-04-08 09:32:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:07,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517922052] [2022-04-08 09:32:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(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); {154#true} is VALID [2022-04-08 09:32:07,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 09:32:07,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #57#return; {154#true} is VALID [2022-04-08 09:32:07,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:07,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(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); {154#true} is VALID [2022-04-08 09:32:07,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 09:32:07,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #57#return; {154#true} is VALID [2022-04-08 09:32:07,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret3 := main(); {154#true} is VALID [2022-04-08 09:32:07,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 1;~y~0 := 0; {159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {159#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,676 INFO L272 TraceCheckUtils]: 9: Hoare triple {159#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:07,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:07,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-08 09:32:07,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-08 09:32:07,677 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-08 09:32:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517922052] [2022-04-08 09:32:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517922052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:32:07,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:07,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310708072] [2022-04-08 09:32:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310708072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:32:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863694236] [2022-04-08 09:32:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 09:32:07,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:07,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:32:07,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:07,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:32:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:32:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:32:07,690 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:32:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,788 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-08 09:32:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:32:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 09:32:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:32:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:32:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:32:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:32:07,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-08 09:32:07,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:07,809 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:32:07,809 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:32:07,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:32:07,810 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:07,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:32:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:32:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:32:07,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:07,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 09:32:07,816 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 09:32:07,816 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 09:32:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,817 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:32:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:32:07,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:07,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:07,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-08 09:32:07,818 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-08 09:32:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:07,819 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:32:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:32:07,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:07,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:07,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:07,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 09:32:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 09:32:07,820 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-08 09:32:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:07,820 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 09:32:07,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:32:07,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 09:32:07,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:32:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:32:07,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:07,836 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:07,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:32:07,836 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1104509419, now seen corresponding path program 1 times [2022-04-08 09:32:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329884541] [2022-04-08 09:32:07,852 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:07,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1104509419, now seen corresponding path program 2 times [2022-04-08 09:32:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:07,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315338506] [2022-04-08 09:32:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#(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); {283#true} is VALID [2022-04-08 09:32:07,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-08 09:32:07,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} #57#return; {283#true} is VALID [2022-04-08 09:32:07,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:07,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#(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); {283#true} is VALID [2022-04-08 09:32:07,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-08 09:32:07,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #57#return; {283#true} is VALID [2022-04-08 09:32:07,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret3 := main(); {283#true} is VALID [2022-04-08 09:32:07,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 1;~y~0 := 0; {288#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:32:07,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#(= (+ (- 1) main_~x~0) 0)} #t~short2 := ~y~0 < 1000; {288#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:32:07,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(= (+ (- 1) main_~x~0) 0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {288#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-08 09:32:07,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= (+ (- 1) main_~x~0) 0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:07,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {289#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:07,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {290#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {291#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:07,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {284#false} is VALID [2022-04-08 09:32:07,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-08 09:32:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:07,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315338506] [2022-04-08 09:32:07,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315338506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:07,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756008036] [2022-04-08 09:32:07,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:32:07,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:07,916 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-08 09:32:07,917 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-08 09:32:07,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:32:07,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:07,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:32:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:07,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:08,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {283#true} is VALID [2022-04-08 09:32:08,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#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); {283#true} is VALID [2022-04-08 09:32:08,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-08 09:32:08,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #57#return; {283#true} is VALID [2022-04-08 09:32:08,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret3 := main(); {283#true} is VALID [2022-04-08 09:32:08,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 1;~y~0 := 0; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,095 INFO L272 TraceCheckUtils]: 12: Hoare triple {289#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:08,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:08,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {284#false} is VALID [2022-04-08 09:32:08,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-08 09:32:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:08,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:08,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-08 09:32:08,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {337#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {284#false} is VALID [2022-04-08 09:32:08,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {333#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:08,212 INFO L272 TraceCheckUtils]: 12: Hoare triple {289#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:08,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {289#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {311#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 1;~y~0 := 0; {311#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret3 := main(); {283#true} is VALID [2022-04-08 09:32:08,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #57#return; {283#true} is VALID [2022-04-08 09:32:08,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-08 09:32:08,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#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); {283#true} is VALID [2022-04-08 09:32:08,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {283#true} is VALID [2022-04-08 09:32:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756008036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:08,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:08,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-08 09:32:08,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:08,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329884541] [2022-04-08 09:32:08,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329884541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:08,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:08,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:32:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861788354] [2022-04-08 09:32:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-08 09:32:08,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:08,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:32:08,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:08,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:32:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:32:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:32:08,233 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:32:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:08,362 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 09:32:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:32:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-08 09:32:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:32:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-08 09:32:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:32:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-08 09:32:08,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-08 09:32:08,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:08,389 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:32:08,389 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:32:08,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:32:08,390 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:08,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:32:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:32:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 09:32:08,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:08,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,396 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,396 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:08,397 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 09:32:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 09:32:08,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:08,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:08,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,397 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:08,398 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 09:32:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 09:32:08,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:08,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:08,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:08,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:32:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 09:32:08,400 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2022-04-08 09:32:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:08,400 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 09:32:08,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-08 09:32:08,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-08 09:32:08,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 09:32:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:32:08,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:08,417 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:08,433 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-08 09:32:08,633 WARN L460 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-08 09:32:08,634 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash -812115269, now seen corresponding path program 3 times [2022-04-08 09:32:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:08,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900002872] [2022-04-08 09:32:08,640 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:08,641 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -812115269, now seen corresponding path program 4 times [2022-04-08 09:32:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025075885] [2022-04-08 09:32:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:08,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#(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); {529#true} is VALID [2022-04-08 09:32:08,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:32:08,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {529#true} {529#true} #57#return; {529#true} is VALID [2022-04-08 09:32:08,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:08,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#(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); {529#true} is VALID [2022-04-08 09:32:08,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:32:08,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #57#return; {529#true} is VALID [2022-04-08 09:32:08,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret3 := main(); {529#true} is VALID [2022-04-08 09:32:08,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} ~x~0 := 1;~y~0 := 0; {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:08,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:08,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:08,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,731 INFO L272 TraceCheckUtils]: 15: Hoare triple {536#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:08,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:08,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:32:08,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:32:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:08,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025075885] [2022-04-08 09:32:08,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025075885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:08,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630973007] [2022-04-08 09:32:08,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:32:08,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:08,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:08,733 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-08 09:32:08,734 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-08 09:32:08,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:32:08,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:08,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:32:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:08,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:08,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-08 09:32:08,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#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); {529#true} is VALID [2022-04-08 09:32:08,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:32:08,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #57#return; {529#true} is VALID [2022-04-08 09:32:08,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret3 := main(); {529#true} is VALID [2022-04-08 09:32:08,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} ~x~0 := 1;~y~0 := 0; {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:08,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:08,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:08,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:08,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:08,905 INFO L272 TraceCheckUtils]: 15: Hoare triple {536#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:08,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:08,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:32:08,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:32:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:08,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:09,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#false} assume !false; {530#false} is VALID [2022-04-08 09:32:09,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {530#false} is VALID [2022-04-08 09:32:09,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:09,039 INFO L272 TraceCheckUtils]: 15: Hoare triple {536#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:09,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:09,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:09,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:09,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {536#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:09,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:09,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:09,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {630#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {535#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:09,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {630#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {630#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#true} ~x~0 := 1;~y~0 := 0; {630#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {529#true} call #t~ret3 := main(); {529#true} is VALID [2022-04-08 09:32:09,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#true} {529#true} #57#return; {529#true} is VALID [2022-04-08 09:32:09,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#true} assume true; {529#true} is VALID [2022-04-08 09:32:09,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#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); {529#true} is VALID [2022-04-08 09:32:09,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {529#true} call ULTIMATE.init(); {529#true} is VALID [2022-04-08 09:32:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:09,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630973007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:09,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:09,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-08 09:32:09,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:09,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900002872] [2022-04-08 09:32:09,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900002872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:09,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:09,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:32:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631719604] [2022-04-08 09:32:09,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-08 09:32:09,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:09,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-08 09:32:09,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:09,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:32:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:32:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:32:09,058 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-08 09:32:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:09,194 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 09:32:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:32:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-08 09:32:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-08 09:32:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 09:32:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-08 09:32:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 09:32:09,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-08 09:32:09,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:09,222 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:32:09,222 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:32:09,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:32:09,223 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:09,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 34 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:32:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:32:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 09:32:09,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:09,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-08 09:32:09,232 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-08 09:32:09,232 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-08 09:32:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:09,233 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 09:32:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 09:32:09,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:09,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:09,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 23 states. [2022-04-08 09:32:09,234 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 23 states. [2022-04-08 09:32:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:09,235 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 09:32:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 09:32:09,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:09,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:09,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:09,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-08 09:32:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-08 09:32:09,237 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-04-08 09:32:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:09,237 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-08 09:32:09,237 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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-08 09:32:09,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-08 09:32:09,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 09:32:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:32:09,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:09,256 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:09,274 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-08 09:32:09,472 WARN L460 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-08 09:32:09,472 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1682962453, now seen corresponding path program 5 times [2022-04-08 09:32:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:09,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171396178] [2022-04-08 09:32:09,479 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:09,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1682962453, now seen corresponding path program 6 times [2022-04-08 09:32:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:09,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989208245] [2022-04-08 09:32:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:09,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#(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); {815#true} is VALID [2022-04-08 09:32:09,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#true} assume true; {815#true} is VALID [2022-04-08 09:32:09,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {815#true} {815#true} #57#return; {815#true} is VALID [2022-04-08 09:32:09,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {815#true} call ULTIMATE.init(); {826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:09,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#(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); {815#true} is VALID [2022-04-08 09:32:09,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {815#true} assume true; {815#true} is VALID [2022-04-08 09:32:09,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {815#true} {815#true} #57#return; {815#true} is VALID [2022-04-08 09:32:09,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {815#true} call #t~ret3 := main(); {815#true} is VALID [2022-04-08 09:32:09,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {815#true} ~x~0 := 1;~y~0 := 0; {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:09,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:09,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:09,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {820#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {821#(<= 2 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {821#(<= 2 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {821#(<= 2 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {821#(<= 2 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {821#(<= 2 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:09,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {821#(<= 2 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#(<= 2 main_~x~0)} #t~short2 := ~y~0 < 1000; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {822#(<= 2 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#(<= 2 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} #t~short2 := ~y~0 < 1000; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,624 INFO L272 TraceCheckUtils]: 18: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:09,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {824#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {825#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:09,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {816#false} is VALID [2022-04-08 09:32:09,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#false} assume !false; {816#false} is VALID [2022-04-08 09:32:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:09,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989208245] [2022-04-08 09:32:09,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989208245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:09,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482698861] [2022-04-08 09:32:09,625 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:32:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:09,632 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-08 09:32:09,633 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-08 09:32:09,665 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:32:09,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:09,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:32:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:09,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:09,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {815#true} call ULTIMATE.init(); {815#true} is VALID [2022-04-08 09:32:09,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#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); {815#true} is VALID [2022-04-08 09:32:09,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {815#true} assume true; {815#true} is VALID [2022-04-08 09:32:09,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {815#true} {815#true} #57#return; {815#true} is VALID [2022-04-08 09:32:09,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {815#true} call #t~ret3 := main(); {815#true} is VALID [2022-04-08 09:32:09,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {815#true} ~x~0 := 1;~y~0 := 0; {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:09,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:09,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:09,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:09,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:09,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:09,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#(<= 2 main_~x~0)} #t~short2 := ~y~0 < 1000; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {822#(<= 2 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {822#(<= 2 main_~x~0)} is VALID [2022-04-08 09:32:09,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#(<= 2 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} #t~short2 := ~y~0 < 1000; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {823#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2022-04-08 09:32:09,850 INFO L272 TraceCheckUtils]: 18: Hoare triple {823#(<= (+ main_~y~0 1) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:09,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:09,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {816#false} is VALID [2022-04-08 09:32:09,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#false} assume !false; {816#false} is VALID [2022-04-08 09:32:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:09,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:10,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#false} assume !false; {816#false} is VALID [2022-04-08 09:32:10,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {816#false} is VALID [2022-04-08 09:32:10,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:10,030 INFO L272 TraceCheckUtils]: 18: Hoare triple {906#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:10,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {906#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:10,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {906#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:10,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {906#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:10,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {906#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:10,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {919#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:10,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {919#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {919#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:10,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {919#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:10,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {929#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {929#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {929#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {815#true} ~x~0 := 1;~y~0 := 0; {939#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {815#true} call #t~ret3 := main(); {815#true} is VALID [2022-04-08 09:32:10,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {815#true} {815#true} #57#return; {815#true} is VALID [2022-04-08 09:32:10,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {815#true} assume true; {815#true} is VALID [2022-04-08 09:32:10,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#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); {815#true} is VALID [2022-04-08 09:32:10,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {815#true} call ULTIMATE.init(); {815#true} is VALID [2022-04-08 09:32:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:10,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482698861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:10,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:10,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-08 09:32:10,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:10,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171396178] [2022-04-08 09:32:10,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171396178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:10,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:10,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:32:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884746311] [2022-04-08 09:32:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-08 09:32:10,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:10,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 09:32:10,052 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-08 09:32:10,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:32:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:32:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:32:10,053 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 09:32:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:10,259 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 09:32:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:32:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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 22 [2022-04-08 09:32:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 09:32:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-08 09:32:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 09:32:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-08 09:32:10,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-08 09:32:10,288 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-08 09:32:10,288 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:32:10,288 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 09:32:10,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:32:10,289 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:10,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:32:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 09:32:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 09:32:10,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:10,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-08 09:32:10,302 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-08 09:32:10,302 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-08 09:32:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:10,304 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 09:32:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 09:32:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:10,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:10,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 26 states. [2022-04-08 09:32:10,304 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 26 states. [2022-04-08 09:32:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:10,305 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 09:32:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 09:32:10,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:10,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:10,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:10,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-08 09:32:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-08 09:32:10,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2022-04-08 09:32:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:10,307 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-08 09:32:10,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 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-08 09:32:10,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-08 09:32:10,332 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-08 09:32:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 09:32:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:32:10,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:10,332 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:10,349 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-08 09:32:10,545 WARN L460 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-08 09:32:10,546 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash 806014139, now seen corresponding path program 7 times [2022-04-08 09:32:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524373001] [2022-04-08 09:32:10,553 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:10,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash 806014139, now seen corresponding path program 8 times [2022-04-08 09:32:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:10,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363581422] [2022-04-08 09:32:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:10,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {1156#(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); {1144#true} is VALID [2022-04-08 09:32:10,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-04-08 09:32:10,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1144#true} {1144#true} #57#return; {1144#true} is VALID [2022-04-08 09:32:10,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1144#true} call ULTIMATE.init(); {1156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:10,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1156#(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); {1144#true} is VALID [2022-04-08 09:32:10,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-04-08 09:32:10,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1144#true} {1144#true} #57#return; {1144#true} is VALID [2022-04-08 09:32:10,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {1144#true} call #t~ret3 := main(); {1144#true} is VALID [2022-04-08 09:32:10,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} ~x~0 := 1;~y~0 := 0; {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:10,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:10,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:10,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:10,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#(<= 3 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1151#(<= 4 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {1151#(<= 4 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {1151#(<= 4 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {1151#(<= 4 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1151#(<= 4 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:10,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {1151#(<= 4 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:10,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(<= 4 main_~x~0)} #t~short2 := ~y~0 < 1000; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:10,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {1152#(<= 4 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:10,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {1152#(<= 4 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:10,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} #t~short2 := ~y~0 < 1000; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:10,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:10,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:10,668 INFO L272 TraceCheckUtils]: 21: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1154#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:10,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {1154#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1155#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:10,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {1155#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1145#false} is VALID [2022-04-08 09:32:10,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-04-08 09:32:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:10,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363581422] [2022-04-08 09:32:10,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363581422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925712590] [2022-04-08 09:32:10,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:32:10,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:10,684 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-08 09:32:10,684 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-08 09:32:10,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:32:10,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:32:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:10,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:11,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1144#true} call ULTIMATE.init(); {1144#true} is VALID [2022-04-08 09:32:11,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#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); {1144#true} is VALID [2022-04-08 09:32:11,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-04-08 09:32:11,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1144#true} {1144#true} #57#return; {1144#true} is VALID [2022-04-08 09:32:11,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1144#true} call #t~ret3 := main(); {1144#true} is VALID [2022-04-08 09:32:11,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} ~x~0 := 1;~y~0 := 0; {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:11,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:11,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:11,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:11,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:11,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:11,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {1185#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:11,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:11,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:11,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:11,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(<= 4 main_~x~0)} #t~short2 := ~y~0 < 1000; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:11,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {1152#(<= 4 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1152#(<= 4 main_~x~0)} is VALID [2022-04-08 09:32:11,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1152#(<= 4 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:11,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} #t~short2 := ~y~0 < 1000; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:11,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:11,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1153#(<= (+ main_~y~0 3) main_~x~0)} is VALID [2022-04-08 09:32:11,034 INFO L272 TraceCheckUtils]: 21: Hoare triple {1153#(<= (+ main_~y~0 3) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:11,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:11,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1145#false} is VALID [2022-04-08 09:32:11,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-04-08 09:32:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:11,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:11,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-04-08 09:32:11,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {1230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1145#false} is VALID [2022-04-08 09:32:11,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {1226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:11,511 INFO L272 TraceCheckUtils]: 21: Hoare triple {1246#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:11,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {1246#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1246#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:11,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {1246#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1246#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:11,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {1246#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {1246#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:11,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {1259#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1246#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:11,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {1259#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1259#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:11,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1259#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {1259#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:11,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1259#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:11,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {1269#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1269#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:11,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {1269#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {1269#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:11,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1269#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:11,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:11,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:11,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1279#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:11,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:11,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:11,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} ~x~0 := 1;~y~0 := 0; {1289#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:11,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {1144#true} call #t~ret3 := main(); {1144#true} is VALID [2022-04-08 09:32:11,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1144#true} {1144#true} #57#return; {1144#true} is VALID [2022-04-08 09:32:11,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-04-08 09:32:11,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#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); {1144#true} is VALID [2022-04-08 09:32:11,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1144#true} call ULTIMATE.init(); {1144#true} is VALID [2022-04-08 09:32:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:11,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925712590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:11,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 09:32:11,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524373001] [2022-04-08 09:32:11,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524373001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:11,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:11,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:32:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608092422] [2022-04-08 09:32:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:11,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2022-04-08 09:32:11,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:11,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-08 09:32:11,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:11,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:32:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:32:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:32:11,540 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-08 09:32:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:11,869 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 09:32:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:32:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2022-04-08 09:32:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-08 09:32:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-08 09:32:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-08 09:32:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-08 09:32:11,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-08 09:32:11,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:11,902 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:32:11,902 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:32:11,903 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:32:11,903 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:11,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:32:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:32:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 09:32:11,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:11,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-08 09:32:11,922 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-08 09:32:11,922 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-08 09:32:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:11,923 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 09:32:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 09:32:11,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:11,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:11,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-04-08 09:32:11,924 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-04-08 09:32:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:11,924 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 09:32:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 09:32:11,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:11,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:11,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:11,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-08 09:32:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 09:32:11,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2022-04-08 09:32:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:11,926 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 09:32:11,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-08 09:32:11,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-08 09:32:11,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 09:32:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 09:32:11,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:11,955 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:11,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:32:12,167 WARN L460 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-08 09:32:12,167 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1592268267, now seen corresponding path program 9 times [2022-04-08 09:32:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624894327] [2022-04-08 09:32:12,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:12,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1592268267, now seen corresponding path program 10 times [2022-04-08 09:32:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:12,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015907020] [2022-04-08 09:32:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:12,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {1527#(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); {1514#true} is VALID [2022-04-08 09:32:12,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 09:32:12,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #57#return; {1514#true} is VALID [2022-04-08 09:32:12,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:12,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#(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); {1514#true} is VALID [2022-04-08 09:32:12,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 09:32:12,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #57#return; {1514#true} is VALID [2022-04-08 09:32:12,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret3 := main(); {1514#true} is VALID [2022-04-08 09:32:12,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~x~0 := 1;~y~0 := 0; {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:12,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:12,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:12,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:12,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:12,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:12,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {1520#(<= 4 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:12,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:12,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:12,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#(<= 6 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1522#(<= 7 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:12,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {1522#(<= 7 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {1522#(<= 7 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:12,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {1522#(<= 7 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1522#(<= 7 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:12,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {1522#(<= 7 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {1523#(<= 7 main_~x~0)} #t~short2 := ~y~0 < 1000; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1523#(<= 7 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {1523#(<= 7 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} #t~short2 := ~y~0 < 1000; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1525#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:12,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {1525#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1526#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:12,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1515#false} is VALID [2022-04-08 09:32:12,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-08 09:32:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:12,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015907020] [2022-04-08 09:32:12,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015907020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:12,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995204032] [2022-04-08 09:32:12,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:32:12,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:12,282 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-08 09:32:12,283 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-08 09:32:12,312 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:32:12,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:12,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 09:32:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:12,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:12,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-08 09:32:12,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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); {1514#true} is VALID [2022-04-08 09:32:12,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 09:32:12,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #57#return; {1514#true} is VALID [2022-04-08 09:32:12,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret3 := main(); {1514#true} is VALID [2022-04-08 09:32:12,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~x~0 := 1;~y~0 := 0; {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:12,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:12,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:12,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:12,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:12,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:12,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {1556#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:12,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:12,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:12,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:12,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:12,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:12,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {1523#(<= 7 main_~x~0)} #t~short2 := ~y~0 < 1000; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1523#(<= 7 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1523#(<= 7 main_~x~0)} is VALID [2022-04-08 09:32:12,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {1523#(<= 7 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} #t~short2 := ~y~0 < 1000; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1524#(<= (+ main_~y~0 6) main_~x~0)} is VALID [2022-04-08 09:32:12,648 INFO L272 TraceCheckUtils]: 24: Hoare triple {1524#(<= (+ main_~y~0 6) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:12,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1611#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:12,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {1611#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1515#false} is VALID [2022-04-08 09:32:12,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-08 09:32:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:12,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:13,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-08 09:32:13,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {1611#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1515#false} is VALID [2022-04-08 09:32:13,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1611#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:13,273 INFO L272 TraceCheckUtils]: 24: Hoare triple {1627#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1607#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:13,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1627#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:13,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {1627#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1627#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:13,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {1627#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {1627#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:13,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1627#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:13,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {1640#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1640#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:13,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {1640#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:13,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1640#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:13,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {1650#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1650#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:13,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {1650#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {1650#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:13,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1650#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:13,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1660#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:13,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:13,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1670#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:13,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} ~x~0 := 1;~y~0 := 0; {1680#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:13,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret3 := main(); {1514#true} is VALID [2022-04-08 09:32:13,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #57#return; {1514#true} is VALID [2022-04-08 09:32:13,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 09:32:13,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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); {1514#true} is VALID [2022-04-08 09:32:13,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-08 09:32:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:13,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995204032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:13,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:13,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-08 09:32:13,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:13,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624894327] [2022-04-08 09:32:13,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624894327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:13,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:13,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:32:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883972780] [2022-04-08 09:32:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:13,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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 28 [2022-04-08 09:32:13,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:13,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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-08 09:32:13,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:13,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:32:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:13,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:32:13,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:32:13,305 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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-08 09:32:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:13,724 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 09:32:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:32:13,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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 28 [2022-04-08 09:32:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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-08 09:32:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-08 09:32:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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-08 09:32:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-08 09:32:13,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-04-08 09:32:13,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:13,758 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:32:13,758 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 09:32:13,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:32:13,759 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:13,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 65 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:32:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 09:32:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 09:32:13,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:13,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-08 09:32:13,784 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-08 09:32:13,785 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-08 09:32:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:13,785 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-08 09:32:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 09:32:13,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:13,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:13,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 32 states. [2022-04-08 09:32:13,786 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 32 states. [2022-04-08 09:32:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:13,787 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-08 09:32:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 09:32:13,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:13,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:13,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:13,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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-08 09:32:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-08 09:32:13,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2022-04-08 09:32:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:13,788 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-08 09:32:13,789 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 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-08 09:32:13,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2022-04-08 09:32:13,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 09:32:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 09:32:13,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:13,834 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:13,869 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-08 09:32:14,050 WARN L460 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-08 09:32:14,050 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 137363131, now seen corresponding path program 11 times [2022-04-08 09:32:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:14,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106275974] [2022-04-08 09:32:14,056 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:14,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 137363131, now seen corresponding path program 12 times [2022-04-08 09:32:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335403454] [2022-04-08 09:32:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:14,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(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); {1925#true} is VALID [2022-04-08 09:32:14,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 09:32:14,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1925#true} {1925#true} #57#return; {1925#true} is VALID [2022-04-08 09:32:14,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:14,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#(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); {1925#true} is VALID [2022-04-08 09:32:14,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 09:32:14,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1925#true} {1925#true} #57#return; {1925#true} is VALID [2022-04-08 09:32:14,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {1925#true} call #t~ret3 := main(); {1925#true} is VALID [2022-04-08 09:32:14,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {1925#true} ~x~0 := 1;~y~0 := 0; {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:14,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:14,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:14,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1930#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:14,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:14,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:14,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1931#(<= 5 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:14,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:14,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:14,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1932#(<= 8 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:14,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:14,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:14,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1933#(<= 10 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1934#(<= 11 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:14,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {1934#(<= 11 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {1934#(<= 11 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:14,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1934#(<= 11 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1934#(<= 11 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:14,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#(<= 11 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {1935#(<= 11 main_~x~0)} #t~short2 := ~y~0 < 1000; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {1935#(<= 11 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {1935#(<= 11 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} #t~short2 := ~y~0 < 1000; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,172 INFO L272 TraceCheckUtils]: 27: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {1937#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:14,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {1937#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1938#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:14,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {1938#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 09:32:14,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 09:32:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335403454] [2022-04-08 09:32:14,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335403454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519819989] [2022-04-08 09:32:14,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:32:14,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:14,188 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-08 09:32:14,193 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-08 09:32:14,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 09:32:14,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:14,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 09:32:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:14,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:14,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 09:32:14,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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); {1925#true} is VALID [2022-04-08 09:32:14,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 09:32:14,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1925#true} {1925#true} #57#return; {1925#true} is VALID [2022-04-08 09:32:14,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1925#true} call #t~ret3 := main(); {1925#true} is VALID [2022-04-08 09:32:14,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1925#true} ~x~0 := 1;~y~0 := 0; {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:14,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:14,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:14,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1958#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:14,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:14,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:14,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:14,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:14,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:14,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {1978#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:14,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:14,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:14,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1988#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:14,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:14,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:14,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {1998#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {1935#(<= 11 main_~x~0)} #t~short2 := ~y~0 < 1000; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1935#(<= 11 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1935#(<= 11 main_~x~0)} is VALID [2022-04-08 09:32:14,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1935#(<= 11 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} #t~short2 := ~y~0 < 1000; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {1936#(<= (+ main_~y~0 10) main_~x~0)} is VALID [2022-04-08 09:32:14,592 INFO L272 TraceCheckUtils]: 27: Hoare triple {1936#(<= (+ main_~y~0 10) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:14,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {2029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:14,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {2033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 09:32:14,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 09:32:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:14,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:15,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 09:32:15,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {2033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 09:32:15,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {2029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:15,324 INFO L272 TraceCheckUtils]: 27: Hoare triple {2049#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:15,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {2049#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2049#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:15,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {2049#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2049#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:15,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {2049#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {2049#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:15,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {2062#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2049#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:15,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {2062#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2062#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:15,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {2062#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {2062#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:15,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {2072#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2062#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:15,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {2072#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2072#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:15,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {2072#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {2072#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:15,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2072#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:15,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2082#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2092#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2102#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:15,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1925#true} ~x~0 := 1;~y~0 := 0; {2112#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:15,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1925#true} call #t~ret3 := main(); {1925#true} is VALID [2022-04-08 09:32:15,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1925#true} {1925#true} #57#return; {1925#true} is VALID [2022-04-08 09:32:15,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 09:32:15,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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); {1925#true} is VALID [2022-04-08 09:32:15,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 09:32:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519819989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:15,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:15,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-08 09:32:15,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:15,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106275974] [2022-04-08 09:32:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106275974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:15,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:32:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086073259] [2022-04-08 09:32:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:15,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 31 [2022-04-08 09:32:15,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:15,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-08 09:32:15,371 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-08 09:32:15,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:32:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:32:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:32:15,372 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-08 09:32:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:15,872 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-08 09:32:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:32:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 31 [2022-04-08 09:32:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-08 09:32:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-08 09:32:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-08 09:32:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-08 09:32:15,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-08 09:32:15,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:15,910 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:32:15,910 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:32:15,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 09:32:15,911 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:15,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 72 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:32:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:32:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 09:32:15,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:15,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:32:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:32:15,945 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:32:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:15,946 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-08 09:32:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-08 09:32:15,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:15,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:15,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 35 states. [2022-04-08 09:32:15,946 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 35 states. [2022-04-08 09:32:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:15,947 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-08 09:32:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-08 09:32:15,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:15,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:15,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:15,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-08 09:32:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-08 09:32:15,948 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2022-04-08 09:32:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:15,949 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-08 09:32:15,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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-08 09:32:15,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-08 09:32:15,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-08 09:32:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 09:32:15,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:15,983 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:16,006 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-08 09:32:16,191 WARN L460 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-08 09:32:16,191 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1868407787, now seen corresponding path program 13 times [2022-04-08 09:32:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608012232] [2022-04-08 09:32:16,198 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:16,198 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1868407787, now seen corresponding path program 14 times [2022-04-08 09:32:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622434988] [2022-04-08 09:32:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:16,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {2392#(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); {2377#true} is VALID [2022-04-08 09:32:16,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2377#true} assume true; {2377#true} is VALID [2022-04-08 09:32:16,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2377#true} {2377#true} #57#return; {2377#true} is VALID [2022-04-08 09:32:16,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {2377#true} call ULTIMATE.init(); {2392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:16,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2392#(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); {2377#true} is VALID [2022-04-08 09:32:16,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2377#true} assume true; {2377#true} is VALID [2022-04-08 09:32:16,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2377#true} {2377#true} #57#return; {2377#true} is VALID [2022-04-08 09:32:16,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {2377#true} call #t~ret3 := main(); {2377#true} is VALID [2022-04-08 09:32:16,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2377#true} ~x~0 := 1;~y~0 := 0; {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:16,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:16,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:16,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:16,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:16,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:16,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {2383#(<= 6 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:16,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:16,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:16,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {2384#(<= 10 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:16,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:16,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:16,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {2385#(<= 13 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:16,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:16,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:16,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {2386#(<= 15 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2387#(<= 16 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:16,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {2387#(<= 16 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {2387#(<= 16 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:16,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {2387#(<= 16 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2387#(<= 16 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:16,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {2387#(<= 16 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {2388#(<= 16 main_~x~0)} #t~short2 := ~y~0 < 1000; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {2388#(<= 16 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {2388#(<= 16 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} #t~short2 := ~y~0 < 1000; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,332 INFO L272 TraceCheckUtils]: 30: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:16,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {2390#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2391#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:16,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {2391#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2378#false} is VALID [2022-04-08 09:32:16,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {2378#false} assume !false; {2378#false} is VALID [2022-04-08 09:32:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622434988] [2022-04-08 09:32:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622434988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300678532] [2022-04-08 09:32:16,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:32:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:16,342 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-08 09:32:16,342 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-08 09:32:16,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:32:16,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:16,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 09:32:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:16,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:16,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {2377#true} call ULTIMATE.init(); {2377#true} is VALID [2022-04-08 09:32:16,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2377#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); {2377#true} is VALID [2022-04-08 09:32:16,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {2377#true} assume true; {2377#true} is VALID [2022-04-08 09:32:16,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2377#true} {2377#true} #57#return; {2377#true} is VALID [2022-04-08 09:32:16,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {2377#true} call #t~ret3 := main(); {2377#true} is VALID [2022-04-08 09:32:16,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2377#true} ~x~0 := 1;~y~0 := 0; {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:16,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:16,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:16,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2411#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:16,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:16,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:16,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {2421#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:16,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:16,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:16,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {2431#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:16,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:16,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:16,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {2441#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:16,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:16,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:16,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {2451#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:16,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:16,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:16,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {2461#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {2388#(<= 16 main_~x~0)} #t~short2 := ~y~0 < 1000; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {2388#(<= 16 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2388#(<= 16 main_~x~0)} is VALID [2022-04-08 09:32:16,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {2388#(<= 16 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} #t~short2 := ~y~0 < 1000; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2389#(<= (+ main_~y~0 15) main_~x~0)} is VALID [2022-04-08 09:32:16,828 INFO L272 TraceCheckUtils]: 30: Hoare triple {2389#(<= (+ main_~y~0 15) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:16,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2496#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:16,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {2496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2378#false} is VALID [2022-04-08 09:32:16,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {2378#false} assume !false; {2378#false} is VALID [2022-04-08 09:32:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:16,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:41,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {2378#false} assume !false; {2378#false} is VALID [2022-04-08 09:32:41,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {2496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2378#false} is VALID [2022-04-08 09:32:41,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2496#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:41,820 INFO L272 TraceCheckUtils]: 30: Hoare triple {2512#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:41,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {2512#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2512#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:41,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {2512#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2512#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:41,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {2512#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {2512#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:41,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {2525#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2512#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:41,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {2525#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2525#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:41,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {2525#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {2525#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:41,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {2535#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2525#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:41,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {2535#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2535#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:41,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {2535#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:41,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2535#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:41,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2545#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2555#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2565#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:41,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2575#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:41,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:41,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:41,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {2377#true} ~x~0 := 1;~y~0 := 0; {2585#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:41,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {2377#true} call #t~ret3 := main(); {2377#true} is VALID [2022-04-08 09:32:41,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2377#true} {2377#true} #57#return; {2377#true} is VALID [2022-04-08 09:32:41,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2377#true} assume true; {2377#true} is VALID [2022-04-08 09:32:41,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2377#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); {2377#true} is VALID [2022-04-08 09:32:41,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2377#true} call ULTIMATE.init(); {2377#true} is VALID [2022-04-08 09:32:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:41,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300678532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:41,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:41,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2022-04-08 09:32:41,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608012232] [2022-04-08 09:32:41,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608012232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:41,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:41,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 09:32:41,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385569269] [2022-04-08 09:32:41,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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 34 [2022-04-08 09:32:41,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:41,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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-08 09:32:41,859 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-08 09:32:41,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 09:32:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 09:32:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2022-04-08 09:32:41,859 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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-08 09:32:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:42,730 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-08 09:32:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:32:42,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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 34 [2022-04-08 09:32:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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-08 09:32:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-08 09:32:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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-08 09:32:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-08 09:32:42,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-04-08 09:32:42,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:42,778 INFO L225 Difference]: With dead ends: 43 [2022-04-08 09:32:42,778 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 09:32:42,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 09:32:42,779 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:42,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:32:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 09:32:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 09:32:42,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:42,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-08 09:32:42,822 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-08 09:32:42,823 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-08 09:32:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:42,824 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 09:32:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 09:32:42,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:42,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:42,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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 38 states. [2022-04-08 09:32:42,824 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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 38 states. [2022-04-08 09:32:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:42,825 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 09:32:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 09:32:42,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:42,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:42,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:42,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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-08 09:32:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-08 09:32:42,826 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 34 [2022-04-08 09:32:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:42,826 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-08 09:32:42,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 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-08 09:32:42,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-08 09:32:42,867 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-08 09:32:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-08 09:32:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 09:32:42,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:42,868 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:42,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 09:32:43,084 WARN L460 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-08 09:32:43,084 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1747431611, now seen corresponding path program 15 times [2022-04-08 09:32:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054703113] [2022-04-08 09:32:43,094 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:43,094 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1747431611, now seen corresponding path program 16 times [2022-04-08 09:32:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:43,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371467458] [2022-04-08 09:32:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:43,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {2886#(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); {2870#true} is VALID [2022-04-08 09:32:43,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2870#true} assume true; {2870#true} is VALID [2022-04-08 09:32:43,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2870#true} {2870#true} #57#return; {2870#true} is VALID [2022-04-08 09:32:43,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2870#true} call ULTIMATE.init(); {2886#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:43,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2886#(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); {2870#true} is VALID [2022-04-08 09:32:43,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2870#true} assume true; {2870#true} is VALID [2022-04-08 09:32:43,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2870#true} {2870#true} #57#return; {2870#true} is VALID [2022-04-08 09:32:43,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2870#true} call #t~ret3 := main(); {2870#true} is VALID [2022-04-08 09:32:43,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2870#true} ~x~0 := 1;~y~0 := 0; {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:43,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:43,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:43,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {2875#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:43,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:43,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:43,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {2876#(<= 7 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:43,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:43,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:43,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {2877#(<= 12 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:43,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:43,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:43,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#(<= 16 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:43,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:43,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:43,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {2879#(<= 19 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:43,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:43,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:43,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {2880#(<= 21 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2881#(<= 22 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:43,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {2881#(<= 22 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {2881#(<= 22 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:43,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {2881#(<= 22 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2881#(<= 22 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:43,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {2881#(<= 22 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {2882#(<= 22 main_~x~0)} #t~short2 := ~y~0 < 1000; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {2882#(<= 22 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {2882#(<= 22 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} #t~short2 := ~y~0 < 1000; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,335 INFO L272 TraceCheckUtils]: 33: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:43,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {2884#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2885#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:43,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {2885#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2871#false} is VALID [2022-04-08 09:32:43,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {2871#false} assume !false; {2871#false} is VALID [2022-04-08 09:32:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:43,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371467458] [2022-04-08 09:32:43,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371467458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:43,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267678391] [2022-04-08 09:32:43,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:32:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:43,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:43,337 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-08 09:32:43,338 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-08 09:32:43,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:32:43,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:43,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:32:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:43,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {2870#true} call ULTIMATE.init(); {2870#true} is VALID [2022-04-08 09:32:43,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2870#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); {2870#true} is VALID [2022-04-08 09:32:43,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2870#true} assume true; {2870#true} is VALID [2022-04-08 09:32:43,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2870#true} {2870#true} #57#return; {2870#true} is VALID [2022-04-08 09:32:43,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {2870#true} call #t~ret3 := main(); {2870#true} is VALID [2022-04-08 09:32:43,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2870#true} ~x~0 := 1;~y~0 := 0; {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:43,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:43,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:43,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {2905#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:43,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:43,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:43,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:43,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:43,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:43,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {2925#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:43,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:43,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:43,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {2935#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:43,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:43,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:43,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {2945#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:43,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:43,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:43,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {2955#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:43,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:43,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:43,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {2965#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {2882#(<= 22 main_~x~0)} #t~short2 := ~y~0 < 1000; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {2882#(<= 22 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2882#(<= 22 main_~x~0)} is VALID [2022-04-08 09:32:43,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {2882#(<= 22 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} #t~short2 := ~y~0 < 1000; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {2883#(<= (+ main_~y~0 21) main_~x~0)} is VALID [2022-04-08 09:32:43,993 INFO L272 TraceCheckUtils]: 33: Hoare triple {2883#(<= (+ main_~y~0 21) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:43,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:43,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2871#false} is VALID [2022-04-08 09:32:43,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {2871#false} assume !false; {2871#false} is VALID [2022-04-08 09:32:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 63 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:43,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:32:57,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {2871#false} assume !false; {2871#false} is VALID [2022-04-08 09:32:57,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2871#false} is VALID [2022-04-08 09:32:57,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:57,578 INFO L272 TraceCheckUtils]: 33: Hoare triple {3016#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {2996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:57,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {3016#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3016#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:57,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {3016#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3016#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:57,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {3016#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {3016#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:57,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {3029#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3016#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:32:57,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {3029#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3029#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:57,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {3029#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {3029#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:57,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {3039#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3029#(<= 1 main_~x~0)} is VALID [2022-04-08 09:32:57,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {3039#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3039#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:57,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {3039#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {3039#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:57,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3039#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:57,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3049#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3059#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3069#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:57,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3079#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:32:57,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:57,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:57,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3089#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:32:57,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:32:57,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:32:57,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {2870#true} ~x~0 := 1;~y~0 := 0; {3099#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:32:57,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {2870#true} call #t~ret3 := main(); {2870#true} is VALID [2022-04-08 09:32:57,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2870#true} {2870#true} #57#return; {2870#true} is VALID [2022-04-08 09:32:57,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {2870#true} assume true; {2870#true} is VALID [2022-04-08 09:32:57,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2870#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); {2870#true} is VALID [2022-04-08 09:32:57,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2870#true} call ULTIMATE.init(); {2870#true} is VALID [2022-04-08 09:32:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:57,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267678391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:32:57,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:32:57,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-08 09:32:57,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:32:57,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054703113] [2022-04-08 09:32:57,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054703113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:32:57,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:32:57,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 09:32:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565223515] [2022-04-08 09:32:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:32:57,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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 37 [2022-04-08 09:32:57,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:32:57,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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-08 09:32:57,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:57,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 09:32:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:57,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 09:32:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2022-04-08 09:32:57,622 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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-08 09:32:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:58,701 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-08 09:32:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 09:32:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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 37 [2022-04-08 09:32:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:32:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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-08 09:32:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 09:32:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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-08 09:32:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 09:32:58,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-08 09:32:58,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:58,753 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:32:58,753 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 09:32:58,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=1563, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 09:32:58,754 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 09:32:58,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 86 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 09:32:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 09:32:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 09:32:58,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:32:58,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-08 09:32:58,811 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-08 09:32:58,811 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-08 09:32:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:58,812 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-08 09:32:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-08 09:32:58,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:58,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:58,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 41 states. [2022-04-08 09:32:58,813 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 41 states. [2022-04-08 09:32:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:32:58,814 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-08 09:32:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-08 09:32:58,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:32:58,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:32:58,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:32:58,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:32:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-08 09:32:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-08 09:32:58,815 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 37 [2022-04-08 09:32:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:32:58,815 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-08 09:32:58,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 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-08 09:32:58,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 51 transitions. [2022-04-08 09:32:58,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:32:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-08 09:32:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 09:32:58,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:32:58,861 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:32:58,878 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-08 09:32:59,062 WARN L460 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-08 09:32:59,062 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:32:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:32:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1223733739, now seen corresponding path program 17 times [2022-04-08 09:32:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:32:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303493894] [2022-04-08 09:32:59,069 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:32:59,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:32:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1223733739, now seen corresponding path program 18 times [2022-04-08 09:32:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:32:59,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645600419] [2022-04-08 09:32:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:32:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:32:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:32:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:59,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {3421#(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); {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#true} assume true; {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3404#true} {3404#true} #57#return; {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:32:59,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3421#(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); {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3404#true} assume true; {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3404#true} {3404#true} #57#return; {3404#true} is VALID [2022-04-08 09:32:59,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {3404#true} call #t~ret3 := main(); {3404#true} is VALID [2022-04-08 09:32:59,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {3404#true} ~x~0 := 1;~y~0 := 0; {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:59,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:59,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:32:59,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {3409#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {3410#(<= 8 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:59,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:59,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:32:59,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3411#(<= 14 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:32:59,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {3412#(<= 19 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:59,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:59,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:32:59,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {3413#(<= 23 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:59,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:59,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:32:59,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {3414#(<= 26 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:59,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:59,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:32:59,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {3415#(<= 28 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3416#(<= 29 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:59,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {3416#(<= 29 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {3416#(<= 29 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:59,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {3416#(<= 29 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3416#(<= 29 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:32:59,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {3416#(<= 29 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {3417#(<= 29 main_~x~0)} #t~short2 := ~y~0 < 1000; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {3417#(<= 29 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {3417#(<= 29 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} #t~short2 := ~y~0 < 1000; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,268 INFO L272 TraceCheckUtils]: 36: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:32:59,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3420#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:32:59,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {3420#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3405#false} is VALID [2022-04-08 09:32:59,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2022-04-08 09:32:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:32:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645600419] [2022-04-08 09:32:59,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645600419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:32:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758273817] [2022-04-08 09:32:59,269 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:32:59,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:32:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:32:59,276 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-08 09:32:59,277 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-08 09:32:59,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 09:32:59,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:32:59,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 09:32:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:32:59,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:32:59,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2022-04-08 09:32:59,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#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); {3404#true} is VALID [2022-04-08 09:32:59,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {3404#true} assume true; {3404#true} is VALID [2022-04-08 09:32:59,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3404#true} {3404#true} #57#return; {3404#true} is VALID [2022-04-08 09:32:59,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {3404#true} call #t~ret3 := main(); {3404#true} is VALID [2022-04-08 09:32:59,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {3404#true} ~x~0 := 1;~y~0 := 0; {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:59,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:59,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:32:59,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {3440#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:59,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:59,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:32:59,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {3450#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:59,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:59,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:32:59,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {3460#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:59,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:59,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:32:59,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {3470#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:59,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:59,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:32:59,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {3480#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:59,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:59,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:32:59,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {3490#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:59,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:59,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:32:59,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {3500#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:32:59,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:32:59,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:32:59,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {3510#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {3417#(<= 29 main_~x~0)} #t~short2 := ~y~0 < 1000; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {3417#(<= 29 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3417#(<= 29 main_~x~0)} is VALID [2022-04-08 09:32:59,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {3417#(<= 29 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} #t~short2 := ~y~0 < 1000; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3418#(<= (+ main_~y~0 28) main_~x~0)} is VALID [2022-04-08 09:32:59,946 INFO L272 TraceCheckUtils]: 36: Hoare triple {3418#(<= (+ main_~y~0 28) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:32:59,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:32:59,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {3545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3405#false} is VALID [2022-04-08 09:32:59,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2022-04-08 09:32:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 84 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:32:59,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:11,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2022-04-08 09:33:11,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {3545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3405#false} is VALID [2022-04-08 09:33:11,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:11,993 INFO L272 TraceCheckUtils]: 36: Hoare triple {3561#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:11,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {3561#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3561#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:11,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {3561#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3561#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:11,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {3561#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {3561#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:11,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {3574#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3561#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:11,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {3574#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3574#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:11,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {3574#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {3574#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:11,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {3584#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3574#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:11,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {3584#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3584#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:11,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {3584#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {3584#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:11,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3584#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:11,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:11,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:11,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3594#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:11,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:11,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:12,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3604#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:12,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:12,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:12,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3614#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:12,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:12,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:12,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3624#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:12,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:12,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:12,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3634#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:12,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:12,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:12,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3644#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:12,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:12,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} #t~short2 := ~y~0 < 1000; {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:12,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {3404#true} ~x~0 := 1;~y~0 := 0; {3654#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:12,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {3404#true} call #t~ret3 := main(); {3404#true} is VALID [2022-04-08 09:33:12,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3404#true} {3404#true} #57#return; {3404#true} is VALID [2022-04-08 09:33:12,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {3404#true} assume true; {3404#true} is VALID [2022-04-08 09:33:12,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#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); {3404#true} is VALID [2022-04-08 09:33:12,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2022-04-08 09:33:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:12,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758273817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:12,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:12,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2022-04-08 09:33:12,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:12,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303493894] [2022-04-08 09:33:12,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303493894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:12,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:12,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 09:33:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784919392] [2022-04-08 09:33:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:12,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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 40 [2022-04-08 09:33:12,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:12,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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-08 09:33:12,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:12,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 09:33:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 09:33:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 09:33:12,045 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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-08 09:33:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:13,487 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-04-08 09:33:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 09:33:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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 40 [2022-04-08 09:33:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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-08 09:33:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-04-08 09:33:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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-08 09:33:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-04-08 09:33:13,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2022-04-08 09:33:13,537 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-08 09:33:13,538 INFO L225 Difference]: With dead ends: 49 [2022-04-08 09:33:13,538 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:33:13,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 09:33:13,539 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:13,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 93 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 09:33:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:33:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 09:33:13,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:13,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,608 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,609 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:13,609 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-04-08 09:33:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-04-08 09:33:13,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:13,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:13,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,610 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:13,611 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-04-08 09:33:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-04-08 09:33:13,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:13,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:13,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:13,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-08 09:33:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-04-08 09:33:13,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 40 [2022-04-08 09:33:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:13,612 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-04-08 09:33:13,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 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-08 09:33:13,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 55 transitions. [2022-04-08 09:33:13,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-04-08 09:33:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 09:33:13,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:13,666 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:13,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 09:33:13,867 WARN L460 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-08 09:33:13,867 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash -938351941, now seen corresponding path program 19 times [2022-04-08 09:33:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:13,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986137355] [2022-04-08 09:33:13,874 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:13,874 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -938351941, now seen corresponding path program 20 times [2022-04-08 09:33:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:13,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731652196] [2022-04-08 09:33:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:14,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {3997#(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); {3979#true} is VALID [2022-04-08 09:33:14,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {3979#true} assume true; {3979#true} is VALID [2022-04-08 09:33:14,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3979#true} {3979#true} #57#return; {3979#true} is VALID [2022-04-08 09:33:14,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {3979#true} call ULTIMATE.init(); {3997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:14,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#(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); {3979#true} is VALID [2022-04-08 09:33:14,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {3979#true} assume true; {3979#true} is VALID [2022-04-08 09:33:14,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3979#true} {3979#true} #57#return; {3979#true} is VALID [2022-04-08 09:33:14,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {3979#true} call #t~ret3 := main(); {3979#true} is VALID [2022-04-08 09:33:14,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {3979#true} ~x~0 := 1;~y~0 := 0; {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:14,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:14,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:14,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {3984#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:14,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:14,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:14,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {3985#(<= 9 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {3986#(<= 16 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:14,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:14,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:14,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {3987#(<= 22 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:14,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {3988#(<= 27 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:14,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:14,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:14,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {3989#(<= 31 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:14,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:14,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:14,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {3990#(<= 34 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:14,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:14,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:14,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {3991#(<= 36 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3992#(<= 37 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:14,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {3992#(<= 37 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {3992#(<= 37 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:14,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {3992#(<= 37 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3992#(<= 37 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:14,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {3992#(<= 37 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {3993#(<= 37 main_~x~0)} #t~short2 := ~y~0 < 1000; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {3993#(<= 37 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {3993#(<= 37 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} #t~short2 := ~y~0 < 1000; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,147 INFO L272 TraceCheckUtils]: 39: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {3995#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:14,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {3995#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3996#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:14,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {3996#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3980#false} is VALID [2022-04-08 09:33:14,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {3980#false} assume !false; {3980#false} is VALID [2022-04-08 09:33:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731652196] [2022-04-08 09:33:14,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731652196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842075152] [2022-04-08 09:33:14,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:33:14,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:14,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:14,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:33:14,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 09:33:14,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:33:14,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:14,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 09:33:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:14,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {3979#true} call ULTIMATE.init(); {3979#true} is VALID [2022-04-08 09:33:14,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3979#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); {3979#true} is VALID [2022-04-08 09:33:14,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {3979#true} assume true; {3979#true} is VALID [2022-04-08 09:33:14,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3979#true} {3979#true} #57#return; {3979#true} is VALID [2022-04-08 09:33:14,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {3979#true} call #t~ret3 := main(); {3979#true} is VALID [2022-04-08 09:33:14,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {3979#true} ~x~0 := 1;~y~0 := 0; {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:14,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:14,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:14,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {4016#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:14,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:14,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:14,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {4026#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:14,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:14,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:14,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {4036#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:14,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:14,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:14,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {4046#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:14,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:14,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:14,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {4056#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:14,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:14,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:14,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {4066#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:14,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:14,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:14,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {4076#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:14,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:14,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:14,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {4086#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:14,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:14,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:14,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {4096#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {3993#(<= 37 main_~x~0)} #t~short2 := ~y~0 < 1000; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {3993#(<= 37 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3993#(<= 37 main_~x~0)} is VALID [2022-04-08 09:33:14,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {3993#(<= 37 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} #t~short2 := ~y~0 < 1000; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {3994#(<= (+ main_~y~0 36) main_~x~0)} is VALID [2022-04-08 09:33:14,885 INFO L272 TraceCheckUtils]: 39: Hoare triple {3994#(<= (+ main_~y~0 36) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:14,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:14,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {4131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3980#false} is VALID [2022-04-08 09:33:14,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {3980#false} assume !false; {3980#false} is VALID [2022-04-08 09:33:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:14,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:31,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {3980#false} assume !false; {3980#false} is VALID [2022-04-08 09:33:31,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {4131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3980#false} is VALID [2022-04-08 09:33:31,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:31,179 INFO L272 TraceCheckUtils]: 39: Hoare triple {4147#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:31,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {4147#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {4147#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:31,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {4147#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4147#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:31,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {4147#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {4147#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:31,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {4160#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4147#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:33:31,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {4160#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4160#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:31,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {4160#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {4160#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:31,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {4170#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4160#(<= 1 main_~x~0)} is VALID [2022-04-08 09:33:31,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {4170#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4170#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:31,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {4170#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {4170#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:31,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4170#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:31,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4180#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4190#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4200#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:31,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4210#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:31,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:31,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4220#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:33:31,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:31,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:31,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4230#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:33:31,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:31,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} #t~short2 := ~y~0 < 1000; {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:31,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4240#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:33:31,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {3979#true} ~x~0 := 1;~y~0 := 0; {4250#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:33:31,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {3979#true} call #t~ret3 := main(); {3979#true} is VALID [2022-04-08 09:33:31,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3979#true} {3979#true} #57#return; {3979#true} is VALID [2022-04-08 09:33:31,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {3979#true} assume true; {3979#true} is VALID [2022-04-08 09:33:31,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3979#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); {3979#true} is VALID [2022-04-08 09:33:31,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {3979#true} call ULTIMATE.init(); {3979#true} is VALID [2022-04-08 09:33:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:31,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842075152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:31,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:31,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2022-04-08 09:33:31,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986137355] [2022-04-08 09:33:31,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986137355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:31,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:31,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 09:33:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412372626] [2022-04-08 09:33:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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 43 [2022-04-08 09:33:31,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:31,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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-08 09:33:31,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:31,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 09:33:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:31,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 09:33:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 09:33:31,229 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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-08 09:33:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:32,765 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-08 09:33:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 09:33:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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 43 [2022-04-08 09:33:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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-08 09:33:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-08 09:33:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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-08 09:33:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-08 09:33:32,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-04-08 09:33:32,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:32,804 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:33:32,804 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 09:33:32,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=2215, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 09:33:32,805 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:32,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 100 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 09:33:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 09:33:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 09:33:32,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:32,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-08 09:33:32,856 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-08 09:33:32,857 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-08 09:33:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:32,857 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-08 09:33:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-08 09:33:32,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:32,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:32,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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 47 states. [2022-04-08 09:33:32,858 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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 47 states. [2022-04-08 09:33:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:32,858 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-08 09:33:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-08 09:33:32,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:32,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:32,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:32,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-08 09:33:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-04-08 09:33:32,860 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 43 [2022-04-08 09:33:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:32,860 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-04-08 09:33:32,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 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-08 09:33:32,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2022-04-08 09:33:32,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-08 09:33:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 09:33:32,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:32,904 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:32,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 09:33:33,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 09:33:33,105 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -8306709, now seen corresponding path program 21 times [2022-04-08 09:33:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058516784] [2022-04-08 09:33:33,109 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:33,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash -8306709, now seen corresponding path program 22 times [2022-04-08 09:33:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706674028] [2022-04-08 09:33:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:33,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {4614#(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); {4595#true} is VALID [2022-04-08 09:33:33,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-08 09:33:33,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4595#true} {4595#true} #57#return; {4595#true} is VALID [2022-04-08 09:33:33,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:33,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {4614#(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); {4595#true} is VALID [2022-04-08 09:33:33,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-08 09:33:33,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #57#return; {4595#true} is VALID [2022-04-08 09:33:33,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret3 := main(); {4595#true} is VALID [2022-04-08 09:33:33,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~x~0 := 1;~y~0 := 0; {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:33,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:33,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:33:33,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {4600#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:33:33,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:33:33,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:33:33,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {4601#(<= 10 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:33,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:33,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:33:33,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {4602#(<= 18 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#(<= 25 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:33,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:33,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:33:33,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {4604#(<= 31 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:33:33,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {4605#(<= 36 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:33,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:33,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:33:33,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {4606#(<= 40 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:33,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:33,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:33:33,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {4607#(<= 43 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:33,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:33,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:33:33,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {4608#(<= 45 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4609#(<= 46 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:33,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {4609#(<= 46 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {4609#(<= 46 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:33,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {4609#(<= 46 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4609#(<= 46 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:33:33,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {4609#(<= 46 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:33,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#(<= 46 main_~x~0)} #t~short2 := ~y~0 < 1000; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:33,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#(<= 46 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:33,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {4610#(<= 46 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:33,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} #t~short2 := ~y~0 < 1000; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:33,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:33,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:33,368 INFO L272 TraceCheckUtils]: 42: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {4612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:33,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {4612#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4613#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:33,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {4613#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4596#false} is VALID [2022-04-08 09:33:33,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-08 09:33:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:33,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706674028] [2022-04-08 09:33:33,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706674028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:33,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264841139] [2022-04-08 09:33:33,369 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:33:33,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:33,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:33,370 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:33:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 09:33:33,418 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:33:33,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:33,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 09:33:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:33,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:33,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2022-04-08 09:33:33,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#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); {4595#true} is VALID [2022-04-08 09:33:33,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-08 09:33:33,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #57#return; {4595#true} is VALID [2022-04-08 09:33:33,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret3 := main(); {4595#true} is VALID [2022-04-08 09:33:33,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~x~0 := 1;~y~0 := 0; {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:33,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:33,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:33:33,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:33,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:33,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:33:33,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {4643#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:33,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:33,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:33:33,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {4653#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:33,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:33,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:33:33,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {4663#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:33,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:33,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:33:33,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {4673#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:33,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:33,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:33:33,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {4683#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:33,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:34,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:33:34,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {4693#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:34,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:34,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:33:34,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {4703#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:34,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:34,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:33:34,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {4713#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:33:34,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:33:34,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:33:34,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {4723#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:34,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {4610#(<= 46 main_~x~0)} #t~short2 := ~y~0 < 1000; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:34,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {4610#(<= 46 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4610#(<= 46 main_~x~0)} is VALID [2022-04-08 09:33:34,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {4610#(<= 46 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:34,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} #t~short2 := ~y~0 < 1000; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:34,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:34,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {4611#(<= (+ main_~y~0 45) main_~x~0)} is VALID [2022-04-08 09:33:34,007 INFO L272 TraceCheckUtils]: 42: Hoare triple {4611#(<= (+ main_~y~0 45) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {4754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:34,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {4754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:34,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {4758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4596#false} is VALID [2022-04-08 09:33:34,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-08 09:33:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 135 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:34,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:34:21,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {4596#false} assume !false; {4596#false} is VALID [2022-04-08 09:34:21,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {4758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4596#false} is VALID [2022-04-08 09:34:21,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {4754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:34:21,433 INFO L272 TraceCheckUtils]: 42: Hoare triple {4774#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {4754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:34:21,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {4774#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {4774#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:34:21,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {4774#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4774#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:34:21,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {4774#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {4774#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:34:21,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {4787#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4774#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:34:21,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {4787#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4787#(<= 1 main_~x~0)} is VALID [2022-04-08 09:34:21,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {4787#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {4787#(<= 1 main_~x~0)} is VALID [2022-04-08 09:34:21,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {4797#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4787#(<= 1 main_~x~0)} is VALID [2022-04-08 09:34:21,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {4797#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4797#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:21,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {4797#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {4797#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:21,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4797#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:21,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4807#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4817#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4827#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:21,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4837#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4847#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:34:21,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:34:21,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4857#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:34:21,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:34:21,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} #t~short2 := ~y~0 < 1000; {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:34:21,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4867#(<= (div (+ (- 1) (div (+ main_~x~0 (- 3)) 2)) (- 2)) (+ (* main_~y~0 2) 8))} is VALID [2022-04-08 09:34:21,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {4877#(<= (div (+ (* (- 1) (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 7)) 2)) (- 2))) 9) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:34:21,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {4595#true} ~x~0 := 1;~y~0 := 0; {4887#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:34:21,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {4595#true} call #t~ret3 := main(); {4595#true} is VALID [2022-04-08 09:34:21,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4595#true} {4595#true} #57#return; {4595#true} is VALID [2022-04-08 09:34:21,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {4595#true} assume true; {4595#true} is VALID [2022-04-08 09:34:21,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4595#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); {4595#true} is VALID [2022-04-08 09:34:21,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {4595#true} call ULTIMATE.init(); {4595#true} is VALID [2022-04-08 09:34:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:34:21,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264841139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:34:21,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:34:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2022-04-08 09:34:21,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:34:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058516784] [2022-04-08 09:34:21,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058516784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:34:21,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:34:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 09:34:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719362926] [2022-04-08 09:34:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:34:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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 46 [2022-04-08 09:34:21,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:34:21,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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-08 09:34:21,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:34:21,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 09:34:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:34:21,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 09:34:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1335, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 09:34:21,487 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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-08 09:34:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:34:22,715 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-08 09:34:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 09:34:22,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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 46 [2022-04-08 09:34:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:34:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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-08 09:34:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-08 09:34:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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-08 09:34:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-08 09:34:22,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2022-04-08 09:34:22,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:34:22,755 INFO L225 Difference]: With dead ends: 55 [2022-04-08 09:34:22,755 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 09:34:22,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=387, Invalid=2583, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 09:34:22,756 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:34:22,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 107 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 09:34:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 09:34:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 09:34:22,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:34:22,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-08 09:34:22,822 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-08 09:34:22,822 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-08 09:34:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:34:22,823 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 09:34:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-04-08 09:34:22,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:34:22,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:34:22,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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 50 states. [2022-04-08 09:34:22,823 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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 50 states. [2022-04-08 09:34:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:34:22,824 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 09:34:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-04-08 09:34:22,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:34:22,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:34:22,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:34:22,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:34:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-08 09:34:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-04-08 09:34:22,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 46 [2022-04-08 09:34:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:34:22,826 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-04-08 09:34:22,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 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-08 09:34:22,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 63 transitions. [2022-04-08 09:34:22,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:34:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-04-08 09:34:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 09:34:22,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:34:22,911 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:34:22,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 09:34:23,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 09:34:23,127 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:34:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:34:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash 135173307, now seen corresponding path program 23 times [2022-04-08 09:34:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:34:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059984278] [2022-04-08 09:34:23,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:34:23,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:34:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 135173307, now seen corresponding path program 24 times [2022-04-08 09:34:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:34:23,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740979450] [2022-04-08 09:34:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:34:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:34:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:34:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:34:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:34:23,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {5272#(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); {5252#true} is VALID [2022-04-08 09:34:23,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {5252#true} assume true; {5252#true} is VALID [2022-04-08 09:34:23,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5252#true} {5252#true} #57#return; {5252#true} is VALID [2022-04-08 09:34:23,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {5252#true} call ULTIMATE.init(); {5272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:34:23,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {5272#(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); {5252#true} is VALID [2022-04-08 09:34:23,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {5252#true} assume true; {5252#true} is VALID [2022-04-08 09:34:23,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5252#true} {5252#true} #57#return; {5252#true} is VALID [2022-04-08 09:34:23,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {5252#true} call #t~ret3 := main(); {5252#true} is VALID [2022-04-08 09:34:23,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {5252#true} ~x~0 := 1;~y~0 := 0; {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:34:23,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:34:23,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:34:23,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {5257#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:34:23,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:34:23,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:34:23,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {5258#(<= 11 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:34:23,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:34:23,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:34:23,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {5259#(<= 20 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:34:23,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:34:23,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:34:23,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {5260#(<= 28 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {5261#(<= 35 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:34:23,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:34:23,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:34:23,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {5262#(<= 41 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:34:23,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {5263#(<= 46 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:34:23,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:34:23,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:34:23,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {5264#(<= 50 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:34:23,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:34:23,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:34:23,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {5265#(<= 53 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:23,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:23,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:34:23,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {5266#(<= 55 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5267#(<= 56 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:23,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {5267#(<= 56 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {5267#(<= 56 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:23,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {5267#(<= 56 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5267#(<= 56 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:34:23,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {5267#(<= 56 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:23,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {5268#(<= 56 main_~x~0)} #t~short2 := ~y~0 < 1000; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:23,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {5268#(<= 56 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:23,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {5268#(<= 56 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:23,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} #t~short2 := ~y~0 < 1000; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:23,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:23,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:23,396 INFO L272 TraceCheckUtils]: 45: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {5270#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:34:23,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {5270#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5271#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:34:23,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {5271#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5253#false} is VALID [2022-04-08 09:34:23,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {5253#false} assume !false; {5253#false} is VALID [2022-04-08 09:34:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:34:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:34:23,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740979450] [2022-04-08 09:34:23,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740979450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:34:23,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995291636] [2022-04-08 09:34:23,398 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:34:23,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:34:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:34:23,412 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:34:23,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 09:34:23,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 09:34:23,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:34:23,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:34:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:34:23,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:34:24,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {5252#true} call ULTIMATE.init(); {5252#true} is VALID [2022-04-08 09:34:24,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {5252#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); {5252#true} is VALID [2022-04-08 09:34:24,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {5252#true} assume true; {5252#true} is VALID [2022-04-08 09:34:24,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5252#true} {5252#true} #57#return; {5252#true} is VALID [2022-04-08 09:34:24,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {5252#true} call #t~ret3 := main(); {5252#true} is VALID [2022-04-08 09:34:24,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {5252#true} ~x~0 := 1;~y~0 := 0; {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:34:24,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:34:24,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:34:24,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {5291#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:34:24,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:34:24,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:34:24,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {5301#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:34:24,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:34:24,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:34:24,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {5311#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:34:24,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:34:24,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:34:24,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {5321#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:34:24,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:34:24,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:34:24,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {5331#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:34:24,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:34:24,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:34:24,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {5341#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:34:24,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:34:24,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:34:24,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {5351#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:34:24,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:34:24,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:34:24,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {5361#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:34:24,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:34:24,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:34:24,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {5371#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:34:24,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:34:24,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:34:24,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {5381#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:34:24,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:34:24,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:34:24,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {5391#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:24,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {5268#(<= 56 main_~x~0)} #t~short2 := ~y~0 < 1000; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:24,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {5268#(<= 56 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5268#(<= 56 main_~x~0)} is VALID [2022-04-08 09:34:24,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {5268#(<= 56 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:24,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} #t~short2 := ~y~0 < 1000; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:24,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:24,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {5269#(<= (+ main_~y~0 55) main_~x~0)} is VALID [2022-04-08 09:34:24,081 INFO L272 TraceCheckUtils]: 45: Hoare triple {5269#(<= (+ main_~y~0 55) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {5422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:34:24,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {5422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:34:24,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {5426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5253#false} is VALID [2022-04-08 09:34:24,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {5253#false} assume !false; {5253#false} is VALID [2022-04-08 09:34:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 165 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:34:24,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:35:00,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {5253#false} assume !false; {5253#false} is VALID [2022-04-08 09:35:00,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {5426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5253#false} is VALID [2022-04-08 09:35:00,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {5422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:35:00,518 INFO L272 TraceCheckUtils]: 45: Hoare triple {5442#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {5422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:35:00,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {5442#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {5442#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:00,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {5442#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5442#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:00,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {5442#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {5442#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:00,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {5455#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5442#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:00,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {5455#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5455#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:00,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {5455#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {5455#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:00,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {5465#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5455#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:00,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {5465#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5465#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:00,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {5465#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {5465#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:00,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5465#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:00,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5475#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5485#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5495#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5505#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5515#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5525#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5535#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:00,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5545#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:00,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5555#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:00,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {5252#true} ~x~0 := 1;~y~0 := 0; {5565#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:00,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {5252#true} call #t~ret3 := main(); {5252#true} is VALID [2022-04-08 09:35:00,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5252#true} {5252#true} #57#return; {5252#true} is VALID [2022-04-08 09:35:00,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {5252#true} assume true; {5252#true} is VALID [2022-04-08 09:35:00,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {5252#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); {5252#true} is VALID [2022-04-08 09:35:00,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {5252#true} call ULTIMATE.init(); {5252#true} is VALID [2022-04-08 09:35:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:35:00,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995291636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:35:00,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:35:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2022-04-08 09:35:00,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:35:00,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059984278] [2022-04-08 09:35:00,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059984278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:35:00,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:35:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 09:35:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417571259] [2022-04-08 09:35:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:35:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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 49 [2022-04-08 09:35:00,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:35:00,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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-08 09:35:00,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:00,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 09:35:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:35:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 09:35:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 09:35:00,575 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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-08 09:35:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:02,569 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-08 09:35:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 09:35:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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 49 [2022-04-08 09:35:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:35:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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-08 09:35:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 09:35:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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-08 09:35:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 09:35:02,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-04-08 09:35:02,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:02,630 INFO L225 Difference]: With dead ends: 58 [2022-04-08 09:35:02,630 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 09:35:02,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=443, Invalid=2979, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 09:35:02,631 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:35:02,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 114 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 09:35:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 09:35:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 09:35:02,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:35:02,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-08 09:35:02,745 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-08 09:35:02,745 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-08 09:35:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:02,746 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-08 09:35:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-08 09:35:02,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:35:02,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:35:02,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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 53 states. [2022-04-08 09:35:02,747 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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 53 states. [2022-04-08 09:35:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:02,747 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-08 09:35:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-08 09:35:02,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:35:02,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:35:02,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:35:02,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:35:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-08 09:35:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-08 09:35:02,749 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 49 [2022-04-08 09:35:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:35:02,749 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-08 09:35:02,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 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-08 09:35:02,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-08 09:35:02,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-08 09:35:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 09:35:02,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:35:02,812 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:35:02,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 09:35:03,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 09:35:03,012 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:35:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:35:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1055870443, now seen corresponding path program 25 times [2022-04-08 09:35:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:35:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065592033] [2022-04-08 09:35:03,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:35:03,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:35:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1055870443, now seen corresponding path program 26 times [2022-04-08 09:35:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:35:03,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894355951] [2022-04-08 09:35:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:35:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:35:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:35:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:03,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {5971#(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); {5950#true} is VALID [2022-04-08 09:35:03,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {5950#true} assume true; {5950#true} is VALID [2022-04-08 09:35:03,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5950#true} {5950#true} #57#return; {5950#true} is VALID [2022-04-08 09:35:03,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {5950#true} call ULTIMATE.init(); {5971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:35:03,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {5971#(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); {5950#true} is VALID [2022-04-08 09:35:03,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {5950#true} assume true; {5950#true} is VALID [2022-04-08 09:35:03,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5950#true} {5950#true} #57#return; {5950#true} is VALID [2022-04-08 09:35:03,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {5950#true} call #t~ret3 := main(); {5950#true} is VALID [2022-04-08 09:35:03,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {5950#true} ~x~0 := 1;~y~0 := 0; {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:03,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:03,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:03,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {5955#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:03,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:03,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:03,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#(<= 12 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:03,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:03,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:03,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {5957#(<= 22 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:03,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:03,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:03,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {5958#(<= 31 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:03,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:03,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:03,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {5959#(<= 39 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {5960#(<= 46 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:03,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:03,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:03,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {5961#(<= 52 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:03,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {5962#(<= 57 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:03,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:03,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:03,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {5963#(<= 61 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:03,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:03,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:03,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {5964#(<= 64 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:03,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:03,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:03,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {5965#(<= 66 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5966#(<= 67 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:03,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {5966#(<= 67 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {5966#(<= 67 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:03,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {5966#(<= 67 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5966#(<= 67 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:03,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {5966#(<= 67 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:03,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {5967#(<= 67 main_~x~0)} #t~short2 := ~y~0 < 1000; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:03,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {5967#(<= 67 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:03,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {5967#(<= 67 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:03,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} #t~short2 := ~y~0 < 1000; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:03,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:03,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:03,316 INFO L272 TraceCheckUtils]: 48: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {5969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:35:03,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {5969#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5970#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:35:03,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {5970#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5951#false} is VALID [2022-04-08 09:35:03,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {5951#false} assume !false; {5951#false} is VALID [2022-04-08 09:35:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:35:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:35:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894355951] [2022-04-08 09:35:03,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894355951] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:35:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903909747] [2022-04-08 09:35:03,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:35:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:35:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:35:03,318 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:35:03,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 09:35:03,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:35:03,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:35:03,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 09:35:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:03,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:35:04,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {5950#true} call ULTIMATE.init(); {5950#true} is VALID [2022-04-08 09:35:04,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {5950#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); {5950#true} is VALID [2022-04-08 09:35:04,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {5950#true} assume true; {5950#true} is VALID [2022-04-08 09:35:04,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5950#true} {5950#true} #57#return; {5950#true} is VALID [2022-04-08 09:35:04,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {5950#true} call #t~ret3 := main(); {5950#true} is VALID [2022-04-08 09:35:04,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {5950#true} ~x~0 := 1;~y~0 := 0; {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:04,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:04,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:04,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {5990#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:04,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:04,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:04,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {6000#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:04,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:04,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:04,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {6010#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:04,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:04,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:04,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {6020#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:04,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:04,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:04,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {6030#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:04,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:04,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:04,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {6040#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:04,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:04,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:04,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {6050#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:04,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:04,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:04,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {6060#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:04,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:04,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:04,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {6070#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:04,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:04,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:04,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {6080#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:04,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:04,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:04,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:04,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:04,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:04,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {6100#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:04,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {5967#(<= 67 main_~x~0)} #t~short2 := ~y~0 < 1000; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:04,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {5967#(<= 67 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5967#(<= 67 main_~x~0)} is VALID [2022-04-08 09:35:04,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {5967#(<= 67 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:04,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} #t~short2 := ~y~0 < 1000; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:04,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:04,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {5968#(<= (+ 66 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:35:04,076 INFO L272 TraceCheckUtils]: 48: Hoare triple {5968#(<= (+ 66 main_~y~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {6131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:35:04,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {6131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:35:04,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {6135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5951#false} is VALID [2022-04-08 09:35:04,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {5951#false} assume !false; {5951#false} is VALID [2022-04-08 09:35:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 198 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:35:04,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:35:43,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (let ((.cse1 (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (.cse0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171)) (.cse2 (* 2 aux_div_aux_div_v_main_~y~0_214_64_48))) (or (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ (* 2 c_main_~y~0) 3 (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) c_main_~x~0)) (< (+ .cse0 4 c_main_~y~0) .cse1) (<= .cse1 (+ 2 .cse0 c_main_~y~0)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= (+ .cse2 (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3) c_main_~x~0 c_main_~y~0) (- 2))) 0) (<= 1 (+ .cse2 aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ 6 c_main_~y~0)) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))) is different from false [2022-04-08 09:35:46,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {5951#false} assume !false; {5951#false} is VALID [2022-04-08 09:35:46,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {6135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5951#false} is VALID [2022-04-08 09:35:46,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {6131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:35:46,096 INFO L272 TraceCheckUtils]: 48: Hoare triple {6151#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {6131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:35:46,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {6151#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {6151#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:46,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {6151#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6151#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:46,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {6151#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {6151#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:46,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {6164#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6151#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:35:46,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {6164#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6164#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:46,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {6164#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {6164#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:46,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {6174#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6164#(<= 1 main_~x~0)} is VALID [2022-04-08 09:35:46,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {6174#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6174#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:46,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {6174#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {6174#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:46,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6174#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:46,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6184#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6194#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6204#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6214#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6224#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:46,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:46,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6234#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:46,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6244#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:46,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6254#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:35:46,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6264#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:35:46,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:46,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:35:48,131 WARN L290 TraceCheckUtils]: 8: Hoare triple {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6274#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is UNKNOWN [2022-04-08 09:35:48,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} is VALID [2022-04-08 09:35:48,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} #t~short2 := ~y~0 < 1000; {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} is VALID [2022-04-08 09:35:48,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {5950#true} ~x~0 := 1;~y~0 := 0; {6284#(forall ((aux_div_aux_div_v_main_~y~0_214_64_48 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_225_50_64 Int)) (or (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) (div (+ (* 15 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 3) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (- 6)) (- 3)) (- 2))) 0) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 10 aux_div_aux_div_v_main_~y~0_214_64_48) (* aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2))) (< (+ main_~y~0 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171) 4) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171) (<= aux_div_aux_div_v_main_~y~0_214_64_48 (+ main_~y~0 6)) (<= 1 (+ (* 2 aux_div_aux_div_v_main_~y~0_214_64_48) aux_div_aux_div_v_main_~x~0_225_50_64)) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 2) (<= (+ aux_mod_aux_mod_aux_div_v_main_~x~0_225_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_225_50_64) (* 5 aux_div_aux_div_v_main_~y~0_214_64_48)) (+ main_~y~0 2 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_225_50_64_171 0)))} is VALID [2022-04-08 09:35:48,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {5950#true} call #t~ret3 := main(); {5950#true} is VALID [2022-04-08 09:35:48,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5950#true} {5950#true} #57#return; {5950#true} is VALID [2022-04-08 09:35:48,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {5950#true} assume true; {5950#true} is VALID [2022-04-08 09:35:48,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {5950#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); {5950#true} is VALID [2022-04-08 09:35:48,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {5950#true} call ULTIMATE.init(); {5950#true} is VALID [2022-04-08 09:35:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-04-08 09:35:48,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903909747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:35:48,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:35:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 47 [2022-04-08 09:35:48,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:35:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065592033] [2022-04-08 09:35:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065592033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:35:48,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:35:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 09:35:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811453874] [2022-04-08 09:35:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:35:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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 52 [2022-04-08 09:35:48,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:35:48,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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-08 09:35:48,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:48,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 09:35:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:35:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 09:35:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1677, Unknown=1, NotChecked=88, Total=2162 [2022-04-08 09:35:48,183 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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-08 09:35:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:50,316 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-08 09:35:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 09:35:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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 52 [2022-04-08 09:35:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:35:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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-08 09:35:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 09:35:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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-08 09:35:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 09:35:50,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-08 09:35:50,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:50,380 INFO L225 Difference]: With dead ends: 61 [2022-04-08 09:35:50,380 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 09:35:50,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=489, Invalid=3296, Unknown=1, NotChecked=120, Total=3906 [2022-04-08 09:35:50,381 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 68 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 09:35:50,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 121 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 09:35:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 09:35:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 09:35:50,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:35:50,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-08 09:35:50,514 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-08 09:35:50,514 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-08 09:35:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:50,515 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 09:35:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 09:35:50,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:35:50,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:35:50,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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 56 states. [2022-04-08 09:35:50,515 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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 56 states. [2022-04-08 09:35:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:35:50,516 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 09:35:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 09:35:50,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:35:50,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:35:50,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:35:50,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:35:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-08 09:35:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-08 09:35:50,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 52 [2022-04-08 09:35:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:35:50,517 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-08 09:35:50,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 17 states have internal predecessors, (48), 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-08 09:35:50,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-08 09:35:50,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:35:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 09:35:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 09:35:50,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:35:50,586 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:35:50,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 09:35:50,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 09:35:50,787 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:35:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:35:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1883096763, now seen corresponding path program 27 times [2022-04-08 09:35:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:35:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1713154758] [2022-04-08 09:35:50,793 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:35:50,793 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:35:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1883096763, now seen corresponding path program 28 times [2022-04-08 09:35:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:35:50,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227761433] [2022-04-08 09:35:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:35:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:35:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:35:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:51,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {6711#(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); {6689#true} is VALID [2022-04-08 09:35:51,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#true} assume true; {6689#true} is VALID [2022-04-08 09:35:51,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6689#true} {6689#true} #57#return; {6689#true} is VALID [2022-04-08 09:35:51,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} call ULTIMATE.init(); {6711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:35:51,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {6711#(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); {6689#true} is VALID [2022-04-08 09:35:51,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} assume true; {6689#true} is VALID [2022-04-08 09:35:51,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} #57#return; {6689#true} is VALID [2022-04-08 09:35:51,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} call #t~ret3 := main(); {6689#true} is VALID [2022-04-08 09:35:51,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} ~x~0 := 1;~y~0 := 0; {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:51,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:51,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:35:51,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:35:51,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} #t~short2 := ~y~0 < 1000; {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:35:51,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:35:51,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {6695#(<= 13 (+ (* main_~y~0 12) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:51,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:51,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:35:51,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {6696#(<= 24 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:51,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:51,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:35:51,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {6697#(<= 34 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:51,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:51,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:35:51,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#(<= 43 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:51,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:51,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:35:51,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {6699#(<= 51 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {6700#(<= 58 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:51,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:51,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:35:51,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {6701#(<= 64 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:35:51,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {6702#(<= 69 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:51,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:51,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:35:51,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {6703#(<= 73 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:51,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:51,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:35:51,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {6704#(<= 76 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:51,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:51,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:35:51,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {6705#(<= 78 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6706#(<= 79 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:51,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {6706#(<= 79 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {6706#(<= 79 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:51,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {6706#(<= 79 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6706#(<= 79 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:35:51,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {6706#(<= 79 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:51,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {6707#(<= 79 main_~x~0)} #t~short2 := ~y~0 < 1000; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:51,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {6707#(<= 79 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:51,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {6707#(<= 79 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:51,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} #t~short2 := ~y~0 < 1000; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:51,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:51,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:51,133 INFO L272 TraceCheckUtils]: 51: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {6709#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:35:51,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {6709#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6710#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:35:51,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {6710#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6690#false} is VALID [2022-04-08 09:35:51,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {6690#false} assume !false; {6690#false} is VALID [2022-04-08 09:35:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:35:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:35:51,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227761433] [2022-04-08 09:35:51,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227761433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:35:51,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278383890] [2022-04-08 09:35:51,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:35:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:35:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:35:51,135 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:35:51,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 09:35:51,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:35:51,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:35:51,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 09:35:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:35:51,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:35:52,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} call ULTIMATE.init(); {6689#true} is VALID [2022-04-08 09:35:52,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#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); {6689#true} is VALID [2022-04-08 09:35:52,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} assume true; {6689#true} is VALID [2022-04-08 09:35:52,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} #57#return; {6689#true} is VALID [2022-04-08 09:35:52,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} call #t~ret3 := main(); {6689#true} is VALID [2022-04-08 09:35:52,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} ~x~0 := 1;~y~0 := 0; {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:52,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:52,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:35:52,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {6730#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:52,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:52,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:35:52,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {6740#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:52,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:52,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:35:52,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {6750#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:52,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:52,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:35:52,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {6760#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:52,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:52,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:35:52,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {6770#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:52,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:52,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:35:52,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {6780#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:52,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:52,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:35:52,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {6790#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:52,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:52,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:35:52,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {6800#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:52,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:52,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:35:52,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {6810#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:52,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:52,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:35:52,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {6820#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:52,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:52,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:35:52,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {6830#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:52,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:52,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:35:52,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {6840#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:35:52,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} #t~short2 := ~y~0 < 1000; {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:35:52,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:35:52,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {6850#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:52,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {6707#(<= 79 main_~x~0)} #t~short2 := ~y~0 < 1000; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:52,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {6707#(<= 79 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6707#(<= 79 main_~x~0)} is VALID [2022-04-08 09:35:52,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {6707#(<= 79 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:52,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} #t~short2 := ~y~0 < 1000; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:52,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:52,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {6708#(<= (+ main_~y~0 78) main_~x~0)} is VALID [2022-04-08 09:35:52,244 INFO L272 TraceCheckUtils]: 51: Hoare triple {6708#(<= (+ main_~y~0 78) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {6881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:35:52,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {6881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:35:52,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {6885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6690#false} is VALID [2022-04-08 09:35:52,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {6690#false} assume !false; {6690#false} is VALID [2022-04-08 09:35:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 234 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:35:52,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:36:15,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {6690#false} assume !false; {6690#false} is VALID [2022-04-08 09:36:15,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {6885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6690#false} is VALID [2022-04-08 09:36:15,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {6881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:36:15,688 INFO L272 TraceCheckUtils]: 51: Hoare triple {6901#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {6881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:36:15,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {6901#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {6901#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:15,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {6901#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6901#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:15,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {6901#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {6901#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:15,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {6914#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6901#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:15,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {6914#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6914#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:15,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {6914#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {6914#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:15,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {6924#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6914#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:15,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {6924#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6924#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:15,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {6924#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {6924#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:15,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6924#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:15,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6934#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6944#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6954#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:15,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6964#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:15,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:15,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:15,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6974#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:15,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:15,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:15,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6984#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:15,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} is VALID [2022-04-08 09:36:15,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} #t~short2 := ~y~0 < 1000; {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} is VALID [2022-04-08 09:36:15,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {6994#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (<= (+ 2 (* aux_mod_aux_div_v_main_~x~0_251_47_68 2)) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_239))))} is VALID [2022-04-08 09:36:15,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:15,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} #t~short2 := ~y~0 < 1000; {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:15,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7004#(forall ((aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2))) (< v_main_~y~0_239 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:15,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} is VALID [2022-04-08 09:36:15,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} #t~short2 := ~y~0 < 1000; {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} is VALID [2022-04-08 09:36:15,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7014#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (+ (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) 1) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (not (<= (+ main_~y~0 1) v_main_~y~0_241))))} is VALID [2022-04-08 09:36:15,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} is VALID [2022-04-08 09:36:15,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} #t~short2 := ~y~0 < 1000; {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} is VALID [2022-04-08 09:36:15,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7024#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_241 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2)))))} is VALID [2022-04-08 09:36:15,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} is VALID [2022-04-08 09:36:15,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} #t~short2 := ~y~0 < 1000; {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} is VALID [2022-04-08 09:36:17,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7034#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (not (<= (+ main_~y~0 1) v_main_~y~0_243)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~y~0 main_~x~0)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2))))} is VALID [2022-04-08 09:36:17,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} is VALID [2022-04-08 09:36:17,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} #t~short2 := ~y~0 < 1000; {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} is VALID [2022-04-08 09:36:17,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} ~x~0 := 1;~y~0 := 0; {7044#(forall ((v_main_~y~0_241 Int) (aux_mod_aux_div_v_main_~x~0_251_47_68 Int) (v_main_~y~0_243 Int) (v_main_~y~0_239 Int) (aux_div_aux_div_v_main_~x~0_251_47_68 Int)) (or (<= aux_div_aux_div_v_main_~x~0_251_47_68 (+ v_main_~y~0_239 5)) (>= aux_mod_aux_div_v_main_~x~0_251_47_68 2) (< v_main_~y~0_243 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_251_47_68) (< v_main_~y~0_239 (+ v_main_~y~0_241 2)) (< v_main_~y~0_241 (+ v_main_~y~0_243 2)) (<= (* aux_mod_aux_div_v_main_~x~0_251_47_68 2) (+ (* v_main_~y~0_243 2) (* 4 aux_div_aux_div_v_main_~x~0_251_47_68) (* v_main_~y~0_241 2) (* v_main_~y~0_239 3) main_~x~0 (* main_~y~0 2) 1))))} is VALID [2022-04-08 09:36:17,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} call #t~ret3 := main(); {6689#true} is VALID [2022-04-08 09:36:17,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} #57#return; {6689#true} is VALID [2022-04-08 09:36:17,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} assume true; {6689#true} is VALID [2022-04-08 09:36:17,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#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); {6689#true} is VALID [2022-04-08 09:36:17,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} call ULTIMATE.init(); {6689#true} is VALID [2022-04-08 09:36:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278383890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:36:17,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:36:17,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 50 [2022-04-08 09:36:17,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:36:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1713154758] [2022-04-08 09:36:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1713154758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:36:17,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:36:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 09:36:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175938880] [2022-04-08 09:36:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:36:17,299 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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 55 [2022-04-08 09:36:17,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:36:17,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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-08 09:36:17,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:36:17,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 09:36:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:36:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 09:36:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1982, Unknown=1, NotChecked=0, Total=2450 [2022-04-08 09:36:17,325 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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-08 09:36:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:19,059 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2022-04-08 09:36:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 09:36:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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 55 [2022-04-08 09:36:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:36:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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-08 09:36:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-04-08 09:36:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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-08 09:36:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-04-08 09:36:19,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 80 transitions. [2022-04-08 09:36:19,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:36:19,123 INFO L225 Difference]: With dead ends: 64 [2022-04-08 09:36:19,123 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 09:36:19,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=567, Invalid=3854, Unknown=1, NotChecked=0, Total=4422 [2022-04-08 09:36:19,124 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:36:19,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 128 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 09:36:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 09:36:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-08 09:36:19,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:36:19,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-08 09:36:19,219 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-08 09:36:19,219 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-08 09:36:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:19,220 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-08 09:36:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2022-04-08 09:36:19,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:36:19,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:36:19,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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 59 states. [2022-04-08 09:36:19,221 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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 59 states. [2022-04-08 09:36:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:19,221 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-08 09:36:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2022-04-08 09:36:19,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:36:19,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:36:19,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:36:19,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:36:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-08 09:36:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2022-04-08 09:36:19,247 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 55 [2022-04-08 09:36:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:36:19,248 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2022-04-08 09:36:19,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 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-08 09:36:19,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 75 transitions. [2022-04-08 09:36:19,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:36:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2022-04-08 09:36:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 09:36:19,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:36:19,302 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:36:19,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 09:36:19,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:36:19,511 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:36:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:36:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1260051435, now seen corresponding path program 29 times [2022-04-08 09:36:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:36:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066278722] [2022-04-08 09:36:19,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:36:19,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:36:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1260051435, now seen corresponding path program 30 times [2022-04-08 09:36:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:36:19,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219569387] [2022-04-08 09:36:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:36:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:36:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:36:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:19,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {7492#(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); {7469#true} is VALID [2022-04-08 09:36:19,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-08 09:36:19,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7469#true} {7469#true} #57#return; {7469#true} is VALID [2022-04-08 09:36:19,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:36:19,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {7492#(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); {7469#true} is VALID [2022-04-08 09:36:19,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-08 09:36:19,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #57#return; {7469#true} is VALID [2022-04-08 09:36:19,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret3 := main(); {7469#true} is VALID [2022-04-08 09:36:19,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 1;~y~0 := 0; {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:19,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:19,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:19,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {7474#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:19,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} #t~short2 := ~y~0 < 1000; {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:19,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:19,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {7475#(<= 14 (+ main_~x~0 (* main_~y~0 13)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:19,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} #t~short2 := ~y~0 < 1000; {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:19,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:19,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {7476#(<= 26 (+ (* main_~y~0 12) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:19,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:19,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:19,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(<= 37 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:19,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:19,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:19,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {7478#(<= 47 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:19,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:19,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:19,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {7479#(<= 56 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:19,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:19,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:19,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {7480#(<= 64 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {7481#(<= 71 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:19,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:19,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:19,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {7482#(<= 77 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:19,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {7483#(<= 82 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:19,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:19,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:19,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {7484#(<= 86 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:19,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:19,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:19,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {7485#(<= 89 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:19,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:19,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:19,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {7486#(<= 91 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7487#(<= 92 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:19,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {7487#(<= 92 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {7487#(<= 92 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:19,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {7487#(<= 92 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7487#(<= 92 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:19,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {7487#(<= 92 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:19,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#(<= 92 main_~x~0)} #t~short2 := ~y~0 < 1000; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:19,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#(<= 92 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:19,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#(<= 92 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:19,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} #t~short2 := ~y~0 < 1000; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:19,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:19,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:19,930 INFO L272 TraceCheckUtils]: 54: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {7490#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:36:19,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {7490#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7491#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:36:19,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {7491#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7470#false} is VALID [2022-04-08 09:36:19,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-08 09:36:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:19,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:36:19,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219569387] [2022-04-08 09:36:19,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219569387] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:36:19,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847597542] [2022-04-08 09:36:19,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:36:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:36:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:36:19,935 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:36:19,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 09:36:19,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 09:36:19,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:36:19,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 09:36:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:20,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:36:21,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7469#true} is VALID [2022-04-08 09:36:21,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#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); {7469#true} is VALID [2022-04-08 09:36:21,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-08 09:36:21,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #57#return; {7469#true} is VALID [2022-04-08 09:36:21,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret3 := main(); {7469#true} is VALID [2022-04-08 09:36:21,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 1;~y~0 := 0; {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:21,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:21,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:21,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {7511#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:21,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:21,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:21,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {7521#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:21,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:21,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:21,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {7531#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:21,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:21,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:21,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {7541#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:21,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:21,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:21,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {7551#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:21,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:21,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:21,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {7561#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:21,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:21,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:21,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {7571#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:21,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:21,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:21,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {7581#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:21,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:21,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:21,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {7591#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:21,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:21,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:21,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {7601#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:21,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:21,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:21,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {7611#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:21,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:21,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:21,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {7621#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:21,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} #t~short2 := ~y~0 < 1000; {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:21,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:21,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:21,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} #t~short2 := ~y~0 < 1000; {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:21,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:21,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {7641#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:21,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#(<= 92 main_~x~0)} #t~short2 := ~y~0 < 1000; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:21,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#(<= 92 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7488#(<= 92 main_~x~0)} is VALID [2022-04-08 09:36:21,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#(<= 92 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:21,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} #t~short2 := ~y~0 < 1000; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:21,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:21,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {7489#(<= (+ 91 main_~y~0) main_~x~0)} is VALID [2022-04-08 09:36:21,080 INFO L272 TraceCheckUtils]: 54: Hoare triple {7489#(<= (+ 91 main_~y~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {7672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:36:21,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {7672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:36:21,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {7676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7470#false} is VALID [2022-04-08 09:36:21,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-08 09:36:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 273 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:21,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:36:45,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-08 09:36:45,119 INFO L290 TraceCheckUtils]: 56: Hoare triple {7676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7470#false} is VALID [2022-04-08 09:36:45,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {7672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:36:45,120 INFO L272 TraceCheckUtils]: 54: Hoare triple {7692#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {7672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:36:45,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {7692#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {7692#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:45,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {7692#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7692#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:45,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {7692#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {7692#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:45,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7692#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:36:45,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {7705#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7705#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:45,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {7705#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {7705#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:45,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {7715#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7705#(<= 1 main_~x~0)} is VALID [2022-04-08 09:36:45,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {7715#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7715#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:45,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {7715#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {7715#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:45,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7715#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:45,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7725#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7735#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7745#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:45,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7755#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:36:45,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:45,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:45,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7765#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:36:45,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:45,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:45,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7775#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:36:45,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:45,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} #t~short2 := ~y~0 < 1000; {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:45,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7785#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_270)) (<= (+ 2 (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68)) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:45,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:45,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} #t~short2 := ~y~0 < 1000; {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:45,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7795#(forall ((aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_270 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:45,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} is VALID [2022-04-08 09:36:45,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} #t~short2 := ~y~0 < 1000; {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} is VALID [2022-04-08 09:36:45,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7805#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (not (<= (+ main_~y~0 1) v_main_~y~0_272)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (+ (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) 1) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4)))))} is VALID [2022-04-08 09:36:45,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:45,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} #t~short2 := ~y~0 < 1000; {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} is VALID [2022-04-08 09:36:47,144 WARN L290 TraceCheckUtils]: 14: Hoare triple {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7815#(forall ((v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (< v_main_~y~0_272 (+ main_~y~0 2))))} is UNKNOWN [2022-04-08 09:36:47,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} #t~short2 := ~y~0 < 1000; {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7825#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4))) (not (<= (+ main_~y~0 1) v_main_~y~0_274)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} #t~short2 := ~y~0 < 1000; {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {7835#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (< v_main_~y~0_274 (+ main_~y~0 2)) (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~x~0 (* v_main_~y~0_274 2) (* main_~y~0 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) 1)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5))))} is VALID [2022-04-08 09:36:47,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} is VALID [2022-04-08 09:36:47,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} #t~short2 := ~y~0 < 1000; {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} is VALID [2022-04-08 09:36:47,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 1;~y~0 := 0; {7845#(forall ((v_main_~y~0_274 Int) (v_main_~y~0_272 Int) (aux_mod_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_276 Int) (aux_div_aux_div_v_main_~x~0_283_47_68 Int) (v_main_~y~0_270 Int)) (or (> 0 aux_mod_aux_div_v_main_~x~0_283_47_68) (<= (* 2 aux_mod_aux_div_v_main_~x~0_283_47_68) (+ (* v_main_~y~0_270 3) main_~y~0 main_~x~0 (* v_main_~y~0_274 2) (* v_main_~y~0_272 2) (* aux_div_aux_div_v_main_~x~0_283_47_68 4) (* v_main_~y~0_276 2) 1)) (< v_main_~y~0_274 (+ v_main_~y~0_276 2)) (< v_main_~y~0_272 (+ v_main_~y~0_274 2)) (>= aux_mod_aux_div_v_main_~x~0_283_47_68 2) (< v_main_~y~0_270 (+ v_main_~y~0_272 2)) (<= aux_div_aux_div_v_main_~x~0_283_47_68 (+ v_main_~y~0_270 5)) (not (<= (+ main_~y~0 1) v_main_~y~0_276))))} is VALID [2022-04-08 09:36:47,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret3 := main(); {7469#true} is VALID [2022-04-08 09:36:47,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #57#return; {7469#true} is VALID [2022-04-08 09:36:47,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-08 09:36:47,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#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); {7469#true} is VALID [2022-04-08 09:36:47,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7469#true} is VALID [2022-04-08 09:36:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847597542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:36:47,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:36:47,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 53 [2022-04-08 09:36:47,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:36:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066278722] [2022-04-08 09:36:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066278722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:36:47,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:36:47,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 09:36:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391802297] [2022-04-08 09:36:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:36:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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 58 [2022-04-08 09:36:47,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:36:47,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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-08 09:36:47,491 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-08 09:36:47,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 09:36:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:36:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 09:36:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2226, Unknown=1, NotChecked=0, Total=2756 [2022-04-08 09:36:47,492 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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-08 09:36:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:50,052 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-08 09:36:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 09:36:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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 58 [2022-04-08 09:36:50,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:36:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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-08 09:36:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-04-08 09:36:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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-08 09:36:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-04-08 09:36:50,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 84 transitions. [2022-04-08 09:36:50,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:36:50,126 INFO L225 Difference]: With dead ends: 67 [2022-04-08 09:36:50,126 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 09:36:50,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=635, Invalid=4334, Unknown=1, NotChecked=0, Total=4970 [2022-04-08 09:36:50,128 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 76 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:36:50,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 09:36:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 09:36:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 09:36:50,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:36:50,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-08 09:36:50,301 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-08 09:36:50,302 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-08 09:36:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:50,302 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 09:36:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-08 09:36:50,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:36:50,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:36:50,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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 62 states. [2022-04-08 09:36:50,303 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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 62 states. [2022-04-08 09:36:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:36:50,304 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 09:36:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-08 09:36:50,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:36:50,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:36:50,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:36:50,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:36:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 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-08 09:36:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-08 09:36:50,305 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 58 [2022-04-08 09:36:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:36:50,305 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-08 09:36:50,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 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-08 09:36:50,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-08 09:36:50,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:36:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-08 09:36:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 09:36:50,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:36:50,397 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:36:50,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 09:36:50,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 09:36:50,598 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:36:50,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:36:50,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1329628997, now seen corresponding path program 31 times [2022-04-08 09:36:50,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:36:50,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948166294] [2022-04-08 09:36:50,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:36:50,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:36:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1329628997, now seen corresponding path program 32 times [2022-04-08 09:36:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:36:50,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007915143] [2022-04-08 09:36:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:36:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:36:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:36:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:50,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {8314#(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); {8290#true} is VALID [2022-04-08 09:36:50,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {8290#true} assume true; {8290#true} is VALID [2022-04-08 09:36:50,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8290#true} {8290#true} #57#return; {8290#true} is VALID [2022-04-08 09:36:50,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {8290#true} call ULTIMATE.init(); {8314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:36:50,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {8314#(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); {8290#true} is VALID [2022-04-08 09:36:50,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {8290#true} assume true; {8290#true} is VALID [2022-04-08 09:36:50,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8290#true} {8290#true} #57#return; {8290#true} is VALID [2022-04-08 09:36:50,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {8290#true} call #t~ret3 := main(); {8290#true} is VALID [2022-04-08 09:36:50,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {8290#true} ~x~0 := 1;~y~0 := 0; {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:50,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:50,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:36:50,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {8295#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:36:50,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} #t~short2 := ~y~0 < 1000; {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:36:50,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:36:50,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {8296#(<= 15 (+ main_~x~0 (* main_~y~0 14)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:50,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} #t~short2 := ~y~0 < 1000; {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:50,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:36:50,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {8297#(<= 28 (+ main_~x~0 (* main_~y~0 13)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:50,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} #t~short2 := ~y~0 < 1000; {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:50,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:36:50,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {8298#(<= 40 (+ (* main_~y~0 12) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:50,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:50,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:36:50,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {8299#(<= 51 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:50,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:50,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:36:50,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {8300#(<= 61 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:50,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:50,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:36:50,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {8301#(<= 70 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:50,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:50,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:36:50,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {8302#(<= 78 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {8303#(<= 85 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:50,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:50,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:36:50,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {8304#(<= 91 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:36:50,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {8305#(<= 96 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:50,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:50,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:36:50,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {8306#(<= 100 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:50,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:50,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:36:50,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {8307#(<= 103 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:50,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:50,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:36:50,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {8308#(<= 105 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8309#(<= 106 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:50,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {8309#(<= 106 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {8309#(<= 106 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:50,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {8309#(<= 106 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8309#(<= 106 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:36:50,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {8309#(<= 106 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:50,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {8310#(<= 106 main_~x~0)} #t~short2 := ~y~0 < 1000; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:50,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {8310#(<= 106 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:50,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {8310#(<= 106 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:50,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} #t~short2 := ~y~0 < 1000; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:50,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:50,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:50,989 INFO L272 TraceCheckUtils]: 57: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {8312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:36:50,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {8312#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8313#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:36:50,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {8313#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8291#false} is VALID [2022-04-08 09:36:50,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {8291#false} assume !false; {8291#false} is VALID [2022-04-08 09:36:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:36:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007915143] [2022-04-08 09:36:50,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007915143] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:36:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86206720] [2022-04-08 09:36:50,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:36:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:36:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:36:50,991 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:36:50,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 09:36:51,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:36:51,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:36:51,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 09:36:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:36:51,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:36:52,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {8290#true} call ULTIMATE.init(); {8290#true} is VALID [2022-04-08 09:36:52,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {8290#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); {8290#true} is VALID [2022-04-08 09:36:52,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {8290#true} assume true; {8290#true} is VALID [2022-04-08 09:36:52,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8290#true} {8290#true} #57#return; {8290#true} is VALID [2022-04-08 09:36:52,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {8290#true} call #t~ret3 := main(); {8290#true} is VALID [2022-04-08 09:36:52,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {8290#true} ~x~0 := 1;~y~0 := 0; {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:52,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:52,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:36:52,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {8333#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:52,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:52,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:36:52,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {8343#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:52,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:52,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:36:52,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {8353#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:52,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:52,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:36:52,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {8363#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:52,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:52,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:36:52,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {8373#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:52,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:52,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:36:52,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {8383#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:52,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:52,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:36:52,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {8393#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:52,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:52,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:36:52,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {8403#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:52,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:52,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:36:52,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {8413#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:52,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:52,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:36:52,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {8423#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:52,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:52,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:36:52,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {8433#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:52,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:52,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:36:52,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {8443#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:52,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} #t~short2 := ~y~0 < 1000; {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:52,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:36:52,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {8453#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:52,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} #t~short2 := ~y~0 < 1000; {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:52,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:36:52,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {8463#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:36:52,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} #t~short2 := ~y~0 < 1000; {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:36:52,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:36:52,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {8473#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:52,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {8310#(<= 106 main_~x~0)} #t~short2 := ~y~0 < 1000; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:52,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {8310#(<= 106 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8310#(<= 106 main_~x~0)} is VALID [2022-04-08 09:36:52,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {8310#(<= 106 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:52,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} #t~short2 := ~y~0 < 1000; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:52,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:52,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {8311#(<= (+ main_~y~0 105) main_~x~0)} is VALID [2022-04-08 09:36:52,141 INFO L272 TraceCheckUtils]: 57: Hoare triple {8311#(<= (+ main_~y~0 105) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {8504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:36:52,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:36:52,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {8508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8291#false} is VALID [2022-04-08 09:36:52,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {8291#false} assume !false; {8291#false} is VALID [2022-04-08 09:36:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 315 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:36:52,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:11,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {8291#false} assume !false; {8291#false} is VALID [2022-04-08 09:39:11,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {8508#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8291#false} is VALID [2022-04-08 09:39:11,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8508#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:11,847 INFO L272 TraceCheckUtils]: 57: Hoare triple {8524#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {8504#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:11,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {8524#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {8524#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:39:11,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {8524#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8524#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:39:11,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {8524#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {8524#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:39:11,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {8537#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8524#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:39:11,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {8537#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8537#(<= 1 main_~x~0)} is VALID [2022-04-08 09:39:11,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {8537#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {8537#(<= 1 main_~x~0)} is VALID [2022-04-08 09:39:11,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {8547#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8537#(<= 1 main_~x~0)} is VALID [2022-04-08 09:39:11,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {8547#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8547#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:11,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {8547#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {8547#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:11,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8547#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:11,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8557#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8567#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8577#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8587#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8597#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:39:11,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:39:11,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8607#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:39:11,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8617#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:11,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8627#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:39:11,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8637#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:39:11,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:39:11,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:39:13,865 WARN L290 TraceCheckUtils]: 17: Hoare triple {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8647#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is UNKNOWN [2022-04-08 09:39:13,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} is VALID [2022-04-08 09:39:13,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} #t~short2 := ~y~0 < 1000; {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} is VALID [2022-04-08 09:39:15,871 WARN L290 TraceCheckUtils]: 14: Hoare triple {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8657#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_307_64_48 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_div_v_main_~x~0_321_50_64 Int)) (or (>= aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (<= 1 (+ aux_div_aux_div_v_main_~x~0_321_50_64 (* 2 aux_div_aux_div_v_main_~y~0_307_64_48))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= aux_div_aux_div_v_main_~y~0_307_64_48 (+ main_~y~0 6)) (<= (+ (* 2 aux_div_aux_div_v_main_~y~0_307_64_48) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (* 15 aux_div_aux_div_v_main_~y~0_307_64_48) main_~y~0 main_~x~0 (- 3) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 6))) (- 2))) 0) (<= (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2))) (< (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) 4) (+ (* 5 aux_div_aux_div_v_main_~y~0_307_64_48) (* aux_div_aux_div_v_main_~x~0_321_50_64 2) aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* aux_div_aux_div_v_main_~y~0_307_64_48 10) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_321_50_64_171)))))} is UNKNOWN [2022-04-08 09:39:15,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} is VALID [2022-04-08 09:39:15,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} #t~short2 := ~y~0 < 1000; {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} is VALID [2022-04-08 09:39:17,881 WARN L290 TraceCheckUtils]: 11: Hoare triple {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8667#(forall ((aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int)) (or (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ main_~y~0 8)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 2) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (>= aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) main_~x~0 (- 4) (* main_~y~0 2)) (- 3))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ (div (+ (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) 5) 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (div (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) (* (- 1) (div (+ (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (- 4)) (* (- 2) aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) main_~y~0 main_~x~0 (- 7) (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)))) (- 5)) (+ aux_div_aux_div_v_main_~y~0_308_214_45 1))))} is UNKNOWN [2022-04-08 09:39:17,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is VALID [2022-04-08 09:39:17,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} #t~short2 := ~y~0 < 1000; {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is VALID [2022-04-08 09:39:19,898 WARN L290 TraceCheckUtils]: 8: Hoare triple {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {8677#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) 1)) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~y~0 main_~x~0 3 (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~y~0 main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is UNKNOWN [2022-04-08 09:39:19,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is VALID [2022-04-08 09:39:19,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} #t~short2 := ~y~0 < 1000; {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is VALID [2022-04-08 09:39:19,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {8290#true} ~x~0 := 1;~y~0 := 0; {8687#(forall ((aux_div_aux_mod_v_main_~y~0_309_197_73 Int) (aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_div_v_main_~x~0_323_55 Int) (aux_div_v_main_~y~0_309_197 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int) (aux_div_aux_mod_v_main_~x~0_323_55_231 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 Int) (aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 Int) (aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 Int) (aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 Int) (aux_div_aux_div_v_main_~y~0_308_214_45 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 Int)) (or (< aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 0) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) aux_div_v_main_~x~0_323_55) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 0) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148) (<= aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 0) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 0) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 1)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_309_197_73 5) 5) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= 5 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (<= (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (+ aux_div_v_main_~y~0_309_197 1)) (<= 2 aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95) (<= (+ 5 (* aux_div_v_main_~y~0_309_197 5)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (<= (+ (* aux_div_aux_div_v_main_~y~0_308_214_45 2) 2) (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95))) (< aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 0) (<= (+ (* 12 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 6)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 6) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 3) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 15) main_~x~0 (* main_~y~0 2) 4 (* 2 aux_div_v_main_~x~0_323_55))) (<= (+ (div (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 (- 2)) 4 (* (- 4) aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59)) (- 4)) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 8 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_aux_mod_v_main_~y~0_309_197_73 5)) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 (+ aux_div_aux_div_v_main_~y~0_308_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) 4)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 8 aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4)) (+ (* aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) main_~x~0 (* main_~y~0 2) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ aux_div_aux_mod_v_main_~x~0_323_55_231 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (* aux_div_v_main_~y~0_309_197 5)) (< (+ aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95)) (+ main_~y~0 2 (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 0) (< (+ aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 (* 2 aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95)) (* aux_div_aux_div_v_main_~y~0_308_214_45 2)) (<= aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 (+ aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) 10 (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55))) (<= 5 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136 4) 4 (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* 20 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_136))) (<= aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 (+ aux_div_aux_mod_v_main_~y~0_309_197_73 1)) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) 12 (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3))) (<= (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) 16 (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 4) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 10) (* aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 4) (* 2 aux_div_v_main_~x~0_323_55)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_323_55_231_249_265_148 20))) (<= (+ (* aux_div_aux_mod_aux_div_v_main_~x~0_321_50_64_171 2) (* aux_div_aux_div_aux_div_v_main_~x~0_321_50_64_59 4) (* aux_div_aux_mod_v_main_~x~0_323_55_231 3)) (+ (* aux_mod_aux_mod_aux_div_v_main_~y~0_308_214_45_95 2) 7 aux_mod_aux_mod_aux_mod_v_main_~y~0_309_197_73_95 (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~y~0_308_214_45_95 4) (* 5 aux_div_aux_mod_aux_mod_v_main_~y~0_309_197_73_95) (* 2 aux_div_v_main_~x~0_323_55))) (<= 2 aux_mod_aux_div_aux_div_v_main_~x~0_321_50_64_59)))} is VALID [2022-04-08 09:39:19,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {8290#true} call #t~ret3 := main(); {8290#true} is VALID [2022-04-08 09:39:19,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8290#true} {8290#true} #57#return; {8290#true} is VALID [2022-04-08 09:39:19,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {8290#true} assume true; {8290#true} is VALID [2022-04-08 09:39:19,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {8290#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); {8290#true} is VALID [2022-04-08 09:39:19,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {8290#true} call ULTIMATE.init(); {8290#true} is VALID [2022-04-08 09:39:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:19,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86206720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:19,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2022-04-08 09:39:19,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948166294] [2022-04-08 09:39:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948166294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:19,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 09:39:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116293073] [2022-04-08 09:39:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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 61 [2022-04-08 09:39:19,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:19,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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-08 09:39:19,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:19,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 09:39:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 09:39:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=2480, Unknown=5, NotChecked=0, Total=3080 [2022-04-08 09:39:19,954 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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-08 09:39:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:23,396 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-04-08 09:39:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 09:39:23,396 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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 61 [2022-04-08 09:39:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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-08 09:39:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2022-04-08 09:39:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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-08 09:39:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2022-04-08 09:39:23,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 88 transitions. [2022-04-08 09:39:23,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:23,469 INFO L225 Difference]: With dead ends: 70 [2022-04-08 09:39:23,469 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 09:39:23,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=707, Invalid=4838, Unknown=5, NotChecked=0, Total=5550 [2022-04-08 09:39:23,471 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:23,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 142 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 09:39:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 09:39:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 09:39:23,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:23,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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-08 09:39:23,700 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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-08 09:39:23,701 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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-08 09:39:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:23,702 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-08 09:39:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-08 09:39:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:23,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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 65 states. [2022-04-08 09:39:23,702 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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 65 states. [2022-04-08 09:39:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:23,707 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-08 09:39:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-08 09:39:23,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:23,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:23,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:23,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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-08 09:39:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-04-08 09:39:23,708 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 61 [2022-04-08 09:39:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:23,709 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-04-08 09:39:23,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 20 states have internal predecessors, (57), 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-08 09:39:23,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 83 transitions. [2022-04-08 09:39:23,807 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-08 09:39:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-08 09:39:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 09:39:23,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:23,807 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:23,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 09:39:24,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 09:39:24,008 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1840661, now seen corresponding path program 33 times [2022-04-08 09:39:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:24,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749226573] [2022-04-08 09:39:24,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:24,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1840661, now seen corresponding path program 34 times [2022-04-08 09:39:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:24,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969974924] [2022-04-08 09:39:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:24,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {9177#(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); {9152#true} is VALID [2022-04-08 09:39:24,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 09:39:24,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #57#return; {9152#true} is VALID [2022-04-08 09:39:24,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:24,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {9177#(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); {9152#true} is VALID [2022-04-08 09:39:24,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 09:39:24,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #57#return; {9152#true} is VALID [2022-04-08 09:39:24,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret3 := main(); {9152#true} is VALID [2022-04-08 09:39:24,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} ~x~0 := 1;~y~0 := 0; {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:39:24,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:39:24,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:39:24,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {9157#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:39:24,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} #t~short2 := ~y~0 < 1000; {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:39:24,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:39:24,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {9158#(<= 16 (+ (* main_~y~0 15) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:39:24,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} #t~short2 := ~y~0 < 1000; {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:39:24,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:39:24,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {9159#(<= 30 (+ main_~x~0 (* main_~y~0 14)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:39:24,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} #t~short2 := ~y~0 < 1000; {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:39:24,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:39:24,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {9160#(<= 43 (+ main_~x~0 (* main_~y~0 13)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:39:24,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} #t~short2 := ~y~0 < 1000; {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:39:24,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:39:24,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {9161#(<= 55 (+ (* main_~y~0 12) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:39:24,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:39:24,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:39:24,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {9162#(<= 66 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:39:24,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:39:24,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:39:24,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {9163#(<= 76 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:39:24,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:39:24,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:39:24,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {9164#(<= 85 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:39:24,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:39:24,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:39:24,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {9165#(<= 93 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {9166#(<= 100 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:39:24,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:39:24,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:39:24,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {9167#(<= 106 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:39:24,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {9168#(<= 111 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:39:24,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:39:24,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:39:24,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {9169#(<= 115 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:39:24,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:39:24,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:39:24,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {9170#(<= 118 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:24,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:24,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:39:24,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {9171#(<= 120 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9172#(<= 121 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:24,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {9172#(<= 121 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {9172#(<= 121 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:24,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {9172#(<= 121 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9172#(<= 121 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:39:24,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {9172#(<= 121 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:24,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {9173#(<= 121 main_~x~0)} #t~short2 := ~y~0 < 1000; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:24,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {9173#(<= 121 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:24,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {9173#(<= 121 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:24,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} #t~short2 := ~y~0 < 1000; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:24,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:24,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:24,436 INFO L272 TraceCheckUtils]: 60: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {9175#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:24,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {9175#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9176#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:24,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {9176#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9153#false} is VALID [2022-04-08 09:39:24,437 INFO L290 TraceCheckUtils]: 63: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-08 09:39:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969974924] [2022-04-08 09:39:24,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969974924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:24,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427902707] [2022-04-08 09:39:24,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:39:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:24,442 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:39:24,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 09:39:24,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:39:24,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:24,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 09:39:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:24,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:25,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-08 09:39:25,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#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); {9152#true} is VALID [2022-04-08 09:39:25,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 09:39:25,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #57#return; {9152#true} is VALID [2022-04-08 09:39:25,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret3 := main(); {9152#true} is VALID [2022-04-08 09:39:25,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} ~x~0 := 1;~y~0 := 0; {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:39:25,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:39:25,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:39:25,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {9196#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:39:25,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:39:25,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:39:25,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {9206#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:39:25,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:39:25,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:39:25,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {9216#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:39:25,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:39:25,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:39:25,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {9226#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:39:25,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:39:25,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:39:25,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {9236#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:39:25,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:39:25,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:39:25,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {9246#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:39:25,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:39:25,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:39:25,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {9256#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:39:25,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:39:25,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:39:25,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {9266#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:39:25,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:39:25,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:39:25,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {9276#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:39:25,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:39:25,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:39:25,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {9286#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:39:25,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:39:25,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:39:25,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {9296#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:39:25,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:39:25,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:39:25,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {9306#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:39:25,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} #t~short2 := ~y~0 < 1000; {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:39:25,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:39:25,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {9316#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:39:25,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} #t~short2 := ~y~0 < 1000; {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:39:25,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:39:25,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {9326#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:39:25,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} #t~short2 := ~y~0 < 1000; {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:39:25,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:39:25,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {9336#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:39:25,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} #t~short2 := ~y~0 < 1000; {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:39:25,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:39:25,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {9346#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:25,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {9173#(<= 121 main_~x~0)} #t~short2 := ~y~0 < 1000; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:25,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {9173#(<= 121 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9173#(<= 121 main_~x~0)} is VALID [2022-04-08 09:39:25,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {9173#(<= 121 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:25,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} #t~short2 := ~y~0 < 1000; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:25,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:25,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {9174#(<= (+ main_~y~0 120) main_~x~0)} is VALID [2022-04-08 09:39:25,822 INFO L272 TraceCheckUtils]: 60: Hoare triple {9174#(<= (+ main_~y~0 120) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {9377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:39:25,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {9377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:39:25,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {9381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9153#false} is VALID [2022-04-08 09:39:25,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-08 09:39:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 360 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:25,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:42:19,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-08 09:42:19,420 INFO L290 TraceCheckUtils]: 62: Hoare triple {9381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9153#false} is VALID [2022-04-08 09:42:19,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {9377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:42:19,421 INFO L272 TraceCheckUtils]: 60: Hoare triple {9397#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {9377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:42:19,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {9397#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {9397#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:42:19,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {9397#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9397#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:42:19,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {9397#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {9397#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:42:19,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {9410#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9397#(<= main_~y~0 main_~x~0)} is VALID [2022-04-08 09:42:19,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {9410#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9410#(<= 1 main_~x~0)} is VALID [2022-04-08 09:42:19,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {9410#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {9410#(<= 1 main_~x~0)} is VALID [2022-04-08 09:42:19,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {9420#(<= 1 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9410#(<= 1 main_~x~0)} is VALID [2022-04-08 09:42:19,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {9420#(<= 1 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9420#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:19,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {9420#(<= 1 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {9420#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:19,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9420#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:19,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9430#(<= 0 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9440#(<= (div (+ main_~y~0 main_~x~0) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9450#(<= (div (+ (- 1) main_~x~0) (- 2)) (+ 3 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9460#(<= (div (+ (* (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) (- 2))) 4) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9470#(<= (div (+ (- 1) main_~y~0 (div (+ main_~x~0 4) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:42:19,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:42:19,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9480#(<= (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0) (- 2)))) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:42:19,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9490#(<= (div (- (div (+ (- 1) main_~x~0) (- 2))) (- 2)) (+ 7 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:19,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} #t~short2 := ~y~0 < 1000; {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9500#(<= (div (+ (* (div (+ (- 1) (div (+ main_~y~0 main_~x~0 (- 3)) 2)) (- 2)) (- 1)) 8) (- 2)) (+ main_~y~0 1))} is VALID [2022-04-08 09:42:19,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} #t~short2 := ~y~0 < 1000; {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9510#(<= (div (+ (- 1) (div (+ (- 1) main_~y~0 (div (+ main_~x~0 26) 2)) 2)) (- 2)) (+ main_~y~0 3))} is VALID [2022-04-08 09:42:19,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:42:19,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} #t~short2 := ~y~0 < 1000; {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is VALID [2022-04-08 09:42:21,187 WARN L290 TraceCheckUtils]: 20: Hoare triple {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9520#(<= (div (+ (- 1) (div (+ main_~y~0 (* (- 1) (div (+ main_~y~0 main_~x~0 18) (- 2)))) 2)) (- 2)) (+ 5 main_~y~0))} is UNKNOWN [2022-04-08 09:42:21,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} is VALID [2022-04-08 09:42:21,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} #t~short2 := ~y~0 < 1000; {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} is VALID [2022-04-08 09:42:23,193 WARN L290 TraceCheckUtils]: 17: Hoare triple {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9530#(forall ((aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_v_main_~y~0_342_64_48 Int) (aux_div_aux_div_v_main_~x~0_357_50_64 Int) (aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) aux_div_aux_div_v_main_~x~0_357_50_64)) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2)) (<= aux_div_aux_div_v_main_~y~0_342_64_48 (+ main_~y~0 6)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (<= (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 2) (div (+ (* 3 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 15) main_~y~0 main_~x~0 (- 3) (* (- 6) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 2))) 0) (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 4) (+ (* aux_div_aux_div_v_main_~y~0_342_64_48 5) aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 (* 2 aux_div_aux_div_v_main_~x~0_357_50_64))) (<= (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (+ main_~x~0 3 (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_v_main_~y~0_342_64_48 10))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_357_50_64_171 2)))} is UNKNOWN [2022-04-08 09:42:23,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} is VALID [2022-04-08 09:42:23,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} #t~short2 := ~y~0 < 1000; {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} is VALID [2022-04-08 09:42:25,201 WARN L290 TraceCheckUtils]: 14: Hoare triple {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9540#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int)) (or (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (+ (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (div (+ 5 main_~x~0 (* main_~y~0 3)) (- 2))) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ main_~y~0 8)) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (<= (div (+ (* (- 1) (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~y~0 main_~x~0 (- 7) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 4))) (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 5)) (+ 1 (div (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* (- 2) aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) 5))) (<= (+ (div (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 2)) main_~x~0 (- 4) (* main_~y~0 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (- 4))) (- 3)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59)) (+ main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)))} is UNKNOWN [2022-04-08 09:42:25,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:25,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} #t~short2 := ~y~0 < 1000; {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:27,211 WARN L290 TraceCheckUtils]: 11: Hoare triple {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9550#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= (+ 7 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (not (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) 1) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 3 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is UNKNOWN [2022-04-08 09:42:27,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:27,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} #t~short2 := ~y~0 < 1000; {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:29,222 WARN L290 TraceCheckUtils]: 8: Hoare triple {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {9560#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) main_~y~0 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~x~0 (* main_~y~0 2) (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* main_~y~0 2) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is UNKNOWN [2022-04-08 09:42:29,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:29,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} #t~short2 := ~y~0 < 1000; {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:29,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} ~x~0 := 1;~y~0 := 0; {9570#(forall ((aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_div_v_main_~y~0_344_197 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499 Int) (aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_div_v_main_~x~0_359_287_113 Int) (aux_div_aux_div_v_main_~x~0_358_214_45 Int) (v_main_~y~0_346 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 Int) (aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 Int) (aux_div_aux_mod_v_main_~y~0_344_197_73 Int) (aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 Int) (aux_div_aux_mod_v_main_~x~0_359_287_447 Int)) (or (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 12) (* 6 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* v_main_~y~0_346 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 15) (* 6 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) main_~y~0 main_~x~0 (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 4)) (<= aux_div_aux_div_v_main_~x~0_359_287_113 (+ aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 1)) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (< (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2)) (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (<= (+ (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 8 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (not (<= (+ main_~y~0 1) v_main_~y~0_346)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 12 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) 10 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (<= (+ 5 (* aux_div_v_main_~y~0_344_197 5)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 1)) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) 16 (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 4) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 20))) (<= (+ 2 (* aux_div_aux_div_v_main_~x~0_358_214_45 2)) (+ aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2))) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 7 (* aux_div_aux_mod_v_main_~x~0_359_287_447 2) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (> 0 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (<= aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (+ aux_div_v_main_~y~0_344_197 1)) (>= aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59 2) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (* aux_div_v_main_~y~0_344_197 5)) (<= (+ (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (+ 5 (* 5 aux_div_aux_mod_v_main_~y~0_344_197_73)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (<= (div (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (- 4)) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* (- 2) aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (- 4)) (+ aux_div_aux_div_v_main_~x~0_358_214_45 1)) (<= (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4) (+ (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) 4 (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4))) (>= aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 5) (<= (+ aux_div_aux_mod_v_main_~x~0_359_287_447 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515)) (>= aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (<= aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 (+ aux_div_aux_mod_v_main_~y~0_344_197_73 1)) (> 0 aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95) (> 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (<= (+ (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 8) (* aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) 6 (* aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 4) (* aux_div_aux_mod_aux_div_v_main_~x~0_358_214_45_95 4)) (+ (* v_main_~y~0_346 2) (* 4 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 10) main_~y~0 main_~x~0 (* 3 aux_div_aux_mod_aux_mod_v_main_~y~0_344_197_73_499) (* 2 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515))) (<= aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515 5) (* 2 aux_mod_aux_div_aux_div_v_main_~x~0_357_50_64_59) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~y~0_344_197_73_499_515) (+ v_main_~y~0_346 (* 2 aux_div_aux_mod_aux_div_v_main_~x~0_357_50_64_171) 2 (* aux_div_aux_div_aux_div_v_main_~x~0_357_50_64_59 4))) (> 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137) (<= (+ 5 (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137)) (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5))) (>= aux_mod_aux_mod_aux_div_v_main_~x~0_358_214_45_95 2) (<= (+ aux_mod_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137 (* aux_div_aux_div_v_main_~x~0_359_287_113 5) 1) (* 5 aux_div_aux_div_aux_mod_aux_mod_v_main_~x~0_359_287_447_549_137))))} is VALID [2022-04-08 09:42:29,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret3 := main(); {9152#true} is VALID [2022-04-08 09:42:29,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #57#return; {9152#true} is VALID [2022-04-08 09:42:29,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-08 09:42:29,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#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); {9152#true} is VALID [2022-04-08 09:42:29,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-08 09:42:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427902707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:42:29,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:42:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2022-04-08 09:42:29,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:42:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749226573] [2022-04-08 09:42:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749226573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:42:29,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:42:29,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 09:42:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409753698] [2022-04-08 09:42:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:42:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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 64 [2022-04-08 09:42:29,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:42:29,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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-08 09:42:29,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:42:29,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 09:42:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 09:42:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=2747, Unknown=10, NotChecked=0, Total=3422 [2022-04-08 09:42:29,281 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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-08 09:42:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:33,034 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-08 09:42:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 09:42:33,034 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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 64 [2022-04-08 09:42:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:42:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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-08 09:42:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2022-04-08 09:42:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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-08 09:42:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 92 transitions. [2022-04-08 09:42:33,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 92 transitions. [2022-04-08 09:42:33,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:42:33,111 INFO L225 Difference]: With dead ends: 73 [2022-04-08 09:42:33,111 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 09:42:33,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=783, Invalid=5369, Unknown=10, NotChecked=0, Total=6162 [2022-04-08 09:42:33,112 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:42:33,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 149 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 09:42:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 09:42:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 09:42:33,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:42:33,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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-08 09:42:33,333 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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-08 09:42:33,333 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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-08 09:42:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:33,334 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-08 09:42:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-08 09:42:33,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:33,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:33,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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 68 states. [2022-04-08 09:42:33,334 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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 68 states. [2022-04-08 09:42:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:42:33,335 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-08 09:42:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-08 09:42:33,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:42:33,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:42:33,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:42:33,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:42:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 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-08 09:42:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2022-04-08 09:42:33,336 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 64 [2022-04-08 09:42:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:42:33,336 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2022-04-08 09:42:33,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 21 states have internal predecessors, (60), 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-08 09:42:33,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 87 transitions. [2022-04-08 09:42:33,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:42:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-08 09:42:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 09:42:33,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:42:33,430 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:42:33,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 09:42:33,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:33,631 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:42:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:42:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash -508319045, now seen corresponding path program 35 times [2022-04-08 09:42:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:42:33,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1115857576] [2022-04-08 09:42:33,636 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:42:33,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:42:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -508319045, now seen corresponding path program 36 times [2022-04-08 09:42:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:42:33,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469149136] [2022-04-08 09:42:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:42:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:42:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:42:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:34,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {10081#(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); {10055#true} is VALID [2022-04-08 09:42:34,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {10055#true} assume true; {10055#true} is VALID [2022-04-08 09:42:34,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10055#true} {10055#true} #57#return; {10055#true} is VALID [2022-04-08 09:42:34,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {10055#true} call ULTIMATE.init(); {10081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:42:34,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {10081#(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); {10055#true} is VALID [2022-04-08 09:42:34,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {10055#true} assume true; {10055#true} is VALID [2022-04-08 09:42:34,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10055#true} {10055#true} #57#return; {10055#true} is VALID [2022-04-08 09:42:34,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {10055#true} call #t~ret3 := main(); {10055#true} is VALID [2022-04-08 09:42:34,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {10055#true} ~x~0 := 1;~y~0 := 0; {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:42:34,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} #t~short2 := ~y~0 < 1000; {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:42:34,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-08 09:42:34,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {10060#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} is VALID [2022-04-08 09:42:34,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} #t~short2 := ~y~0 < 1000; {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} is VALID [2022-04-08 09:42:34,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} is VALID [2022-04-08 09:42:34,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {10061#(<= 17 (+ main_~x~0 (* main_~y~0 16)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:42:34,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} #t~short2 := ~y~0 < 1000; {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:42:34,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} is VALID [2022-04-08 09:42:34,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {10062#(<= 32 (+ (* main_~y~0 15) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:42:34,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} #t~short2 := ~y~0 < 1000; {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:42:34,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} is VALID [2022-04-08 09:42:34,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {10063#(<= 46 (+ main_~x~0 (* main_~y~0 14)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:42:34,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} #t~short2 := ~y~0 < 1000; {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:42:34,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} is VALID [2022-04-08 09:42:34,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {10064#(<= 59 (+ main_~x~0 (* main_~y~0 13)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:42:34,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} #t~short2 := ~y~0 < 1000; {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:42:34,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} is VALID [2022-04-08 09:42:34,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {10065#(<= 71 (+ (* main_~y~0 12) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:42:34,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} #t~short2 := ~y~0 < 1000; {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:42:34,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} is VALID [2022-04-08 09:42:34,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#(<= 82 (+ main_~x~0 (* main_~y~0 11)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:42:34,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} #t~short2 := ~y~0 < 1000; {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:42:34,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} is VALID [2022-04-08 09:42:34,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {10067#(<= 92 (+ main_~x~0 (* main_~y~0 10)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:42:34,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} #t~short2 := ~y~0 < 1000; {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:42:34,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} is VALID [2022-04-08 09:42:34,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {10068#(<= 101 (+ (* main_~y~0 9) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:42:34,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} #t~short2 := ~y~0 < 1000; {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:42:34,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} is VALID [2022-04-08 09:42:34,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {10069#(<= 109 (+ (* main_~y~0 8) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {10070#(<= 116 (+ (* 7 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:42:34,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} #t~short2 := ~y~0 < 1000; {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:42:34,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} is VALID [2022-04-08 09:42:34,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {10071#(<= 122 (+ main_~x~0 (* main_~y~0 6)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} #t~short2 := ~y~0 < 1000; {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} is VALID [2022-04-08 09:42:34,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {10072#(<= 127 (+ (* 5 main_~y~0) main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:42:34,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} #t~short2 := ~y~0 < 1000; {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:42:34,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-08 09:42:34,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {10073#(<= 131 (+ main_~x~0 (* main_~y~0 4)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:42:34,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} #t~short2 := ~y~0 < 1000; {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:42:34,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} is VALID [2022-04-08 09:42:34,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {10074#(<= 134 (+ main_~x~0 (* main_~y~0 3)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:34,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} #t~short2 := ~y~0 < 1000; {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:34,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} is VALID [2022-04-08 09:42:34,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {10075#(<= 136 (+ main_~x~0 (* main_~y~0 2)))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10076#(<= 137 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:34,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {10076#(<= 137 (+ main_~y~0 main_~x~0))} #t~short2 := ~y~0 < 1000; {10076#(<= 137 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:34,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {10076#(<= 137 (+ main_~y~0 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10076#(<= 137 (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 09:42:34,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {10076#(<= 137 (+ main_~y~0 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:34,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {10077#(<= 137 main_~x~0)} #t~short2 := ~y~0 < 1000; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:34,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {10077#(<= 137 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:34,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {10077#(<= 137 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:34,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} #t~short2 := ~y~0 < 1000; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:34,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:34,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:34,080 INFO L272 TraceCheckUtils]: 63: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {10079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:42:34,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {10079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:42:34,081 INFO L290 TraceCheckUtils]: 65: Hoare triple {10080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10056#false} is VALID [2022-04-08 09:42:34,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {10056#false} assume !false; {10056#false} is VALID [2022-04-08 09:42:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:42:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469149136] [2022-04-08 09:42:34,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469149136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:42:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869291869] [2022-04-08 09:42:34,082 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:42:34,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:42:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:42:34,083 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:42:34,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 09:42:34,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 09:42:34,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:42:34,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 09:42:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:42:34,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:42:35,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {10055#true} call ULTIMATE.init(); {10055#true} is VALID [2022-04-08 09:42:35,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {10055#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); {10055#true} is VALID [2022-04-08 09:42:35,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {10055#true} assume true; {10055#true} is VALID [2022-04-08 09:42:35,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10055#true} {10055#true} #57#return; {10055#true} is VALID [2022-04-08 09:42:35,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {10055#true} call #t~ret3 := main(); {10055#true} is VALID [2022-04-08 09:42:35,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {10055#true} ~x~0 := 1;~y~0 := 0; {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:42:35,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:42:35,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-08 09:42:35,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {10100#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:42:35,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} #t~short2 := ~y~0 < 1000; {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:42:35,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-08 09:42:35,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {10110#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:42:35,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} #t~short2 := ~y~0 < 1000; {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:42:35,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} is VALID [2022-04-08 09:42:35,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {10120#(and (<= 2 main_~y~0) (<= 2 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:42:35,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} #t~short2 := ~y~0 < 1000; {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:42:35,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} is VALID [2022-04-08 09:42:35,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {10130#(and (<= 3 main_~y~0) (<= 4 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:42:35,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} #t~short2 := ~y~0 < 1000; {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:42:35,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} is VALID [2022-04-08 09:42:35,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {10140#(and (<= 4 main_~y~0) (<= 7 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:42:35,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} #t~short2 := ~y~0 < 1000; {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:42:35,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} is VALID [2022-04-08 09:42:35,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {10150#(and (<= 5 main_~y~0) (<= 11 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:42:35,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} #t~short2 := ~y~0 < 1000; {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:42:35,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} is VALID [2022-04-08 09:42:35,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= 6 main_~y~0) (<= 16 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:42:35,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} #t~short2 := ~y~0 < 1000; {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:42:35,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} is VALID [2022-04-08 09:42:35,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {10170#(and (<= 7 main_~y~0) (<= 22 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:42:35,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} #t~short2 := ~y~0 < 1000; {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:42:35,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} is VALID [2022-04-08 09:42:35,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {10180#(and (<= 8 main_~y~0) (<= 29 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:42:35,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} #t~short2 := ~y~0 < 1000; {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:42:35,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} is VALID [2022-04-08 09:42:35,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {10190#(and (<= 9 main_~y~0) (<= 37 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:42:35,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} #t~short2 := ~y~0 < 1000; {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:42:35,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} is VALID [2022-04-08 09:42:35,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {10200#(and (<= 46 main_~x~0) (<= 10 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:42:35,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} #t~short2 := ~y~0 < 1000; {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:42:35,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} is VALID [2022-04-08 09:42:35,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {10210#(and (<= 56 main_~x~0) (<= 11 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:42:35,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} #t~short2 := ~y~0 < 1000; {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:42:35,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} is VALID [2022-04-08 09:42:35,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {10220#(and (<= 12 main_~y~0) (<= 67 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:42:35,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} #t~short2 := ~y~0 < 1000; {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:42:35,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} is VALID [2022-04-08 09:42:35,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {10230#(and (<= 79 main_~x~0) (<= 13 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:42:35,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} #t~short2 := ~y~0 < 1000; {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:42:35,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} is VALID [2022-04-08 09:42:35,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {10240#(and (<= 14 main_~y~0) (<= 92 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:42:35,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} #t~short2 := ~y~0 < 1000; {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:42:35,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} is VALID [2022-04-08 09:42:35,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {10250#(and (<= 106 main_~x~0) (<= 15 main_~y~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} is VALID [2022-04-08 09:42:35,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} #t~short2 := ~y~0 < 1000; {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} is VALID [2022-04-08 09:42:35,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} is VALID [2022-04-08 09:42:35,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {10260#(and (<= 16 main_~y~0) (<= 121 main_~x~0))} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:35,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {10077#(<= 137 main_~x~0)} #t~short2 := ~y~0 < 1000; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:35,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {10077#(<= 137 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10077#(<= 137 main_~x~0)} is VALID [2022-04-08 09:42:35,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {10077#(<= 137 main_~x~0)} assume !!#t~short2;havoc #t~nondet1;havoc #t~short2;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:35,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} #t~short2 := ~y~0 < 1000; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:35,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:35,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} assume !#t~short2;havoc #t~nondet1;havoc #t~short2; {10078#(<= (+ main_~y~0 136) main_~x~0)} is VALID [2022-04-08 09:42:35,610 INFO L272 TraceCheckUtils]: 63: Hoare triple {10078#(<= (+ main_~y~0 136) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {10291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:42:35,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {10291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:42:35,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {10295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10056#false} is VALID [2022-04-08 09:42:35,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {10056#false} assume !false; {10056#false} is VALID [2022-04-08 09:42:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 408 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:42:35,612 INFO L328 TraceCheckSpWp]: Computing backward predicates...