/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-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:14:29,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:14:29,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:14:29,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:14:29,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:14:29,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:14:29,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:14:29,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:14:29,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:14:29,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:14:29,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:14:29,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:14:29,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:14:29,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:14:29,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:14:29,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:14:29,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:14:29,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:14:29,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:14:29,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:14:29,570 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:14:29,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:14:29,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:14:29,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:14:29,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:14:29,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:14:29,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:14:29,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:14:29,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:14:29,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:14:29,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:14:29,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:14:29,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:14:29,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:14:29,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:14:29,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:14:29,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:14:29,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:14:29,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:14:29,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:14:29,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:14:29,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:14:29,586 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:14:29,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:14:29,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:14:29,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:14:29,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:14:29,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:14:29,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:14:29,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:14:29,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:14:29,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:14:29,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:14:29,597 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:14:29,598 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:14:29,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:14:29,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:14:29,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:14:29,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:14:29,862 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:14:29,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-08 09:14:29,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc2ce213/7a3b0b6dfd634d1580b1f7a101cb305f/FLAG6f247cbcb [2022-04-08 09:14:30,310 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:14:30,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-08 09:14:30,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc2ce213/7a3b0b6dfd634d1580b1f7a101cb305f/FLAG6f247cbcb [2022-04-08 09:14:30,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bc2ce213/7a3b0b6dfd634d1580b1f7a101cb305f [2022-04-08 09:14:30,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:14:30,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:14:30,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:14:30,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:14:30,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:14:30,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:14:30" (1/1) ... [2022-04-08 09:14:30,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84c72dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:30, skipping insertion in model container [2022-04-08 09:14:30,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:14:30" (1/1) ... [2022-04-08 09:14:30,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:14:30,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:14:30,938 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-acceleration/diamond_2-2.c[373,386] [2022-04-08 09:14:30,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:14:30,990 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:14:31,002 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-acceleration/diamond_2-2.c[373,386] [2022-04-08 09:14:31,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:14:31,043 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:14:31,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31 WrapperNode [2022-04-08 09:14:31,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:14:31,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:14:31,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:14:31,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:14:31,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:14:31,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:14:31,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:14:31,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:14:31,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (1/1) ... [2022-04-08 09:14:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:14:31,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:31,137 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:14:31,159 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:14:31,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:14:31,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:14:31,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:14:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:14:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:14:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:14:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:14:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:14:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:14:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:14:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:14:31,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:14:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:14:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:14:31,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:14:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:14:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:14:31,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:14:31,237 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:14:31,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:14:31,428 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:14:31,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:14:31,434 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:14:31,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:14:31 BoogieIcfgContainer [2022-04-08 09:14:31,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:14:31,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:14:31,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:14:31,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:14:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:14:30" (1/3) ... [2022-04-08 09:14:31,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731570c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:14:31, skipping insertion in model container [2022-04-08 09:14:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:14:31" (2/3) ... [2022-04-08 09:14:31,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731570c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:14:31, skipping insertion in model container [2022-04-08 09:14:31,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:14:31" (3/3) ... [2022-04-08 09:14:31,443 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2022-04-08 09:14:31,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:14:31,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:14:31,502 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:14:31,509 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:14:31,510 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:14:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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:14:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:14:31,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:31,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:31,539 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 1 times [2022-04-08 09:14:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:31,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212201622] [2022-04-08 09:14:31,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:14:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 2 times [2022-04-08 09:14:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:31,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305212576] [2022-04-08 09:14:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:31,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 09:14:31,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 09:14:31,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-08 09:14:31,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:31,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 09:14:31,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 09:14:31,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-08 09:14:31,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2022-04-08 09:14:31,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-08 09:14:31,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-08 09:14:31,769 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-04-08 09:14:31,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 09:14:31,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 09:14:31,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 09:14:31,770 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:14:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305212576] [2022-04-08 09:14:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305212576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:31,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:14:31,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:31,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212201622] [2022-04-08 09:14:31,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212201622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:31,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:31,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:14:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907200408] [2022-04-08 09:14:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:31,782 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:14:31,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:31,787 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:14:31,806 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:14:31,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:14:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:14:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:14:31,832 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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:14:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:31,957 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-08 09:14:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:14:31,958 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:14:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:31,961 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:14:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 09:14:31,977 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:14:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 09:14:31,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-08 09:14:32,075 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:14:32,086 INFO L225 Difference]: With dead ends: 39 [2022-04-08 09:14:32,086 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 09:14:32,089 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:14:32,092 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 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:14:32,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:14:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 09:14:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 09:14:32,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:32,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:14:32,136 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:14:32,137 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:14:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,146 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-08 09:14:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 09:14:32,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:32,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:32,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 22 states. [2022-04-08 09:14:32,148 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 22 states. [2022-04-08 09:14:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,151 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-08 09:14:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 09:14:32,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:32,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:32,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:32,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:14:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-08 09:14:32,157 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-08 09:14:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:32,157 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-08 09:14:32,158 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:14:32,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 32 transitions. [2022-04-08 09:14:32,210 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:14:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 09:14:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:14:32,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:32,212 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:32,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:14:32,216 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 1 times [2022-04-08 09:14:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420405119] [2022-04-08 09:14:32,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:14:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 2 times [2022-04-08 09:14:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:32,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329992384] [2022-04-08 09:14:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:32,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(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(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-08 09:14:32,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-08 09:14:32,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-08 09:14:32,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:32,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(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(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-08 09:14:32,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-08 09:14:32,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-08 09:14:32,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret6 := main(); {205#true} is VALID [2022-04-08 09:14:32,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {210#(= main_~x~0 0)} is VALID [2022-04-08 09:14:32,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {206#false} is VALID [2022-04-08 09:14:32,398 INFO L272 TraceCheckUtils]: 7: Hoare triple {206#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {206#false} is VALID [2022-04-08 09:14:32,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2022-04-08 09:14:32,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#false} assume 0 == ~cond; {206#false} is VALID [2022-04-08 09:14:32,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-04-08 09:14:32,399 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:14:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329992384] [2022-04-08 09:14:32,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329992384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:32,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:32,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:32,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:32,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420405119] [2022-04-08 09:14:32,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420405119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:32,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:32,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479260728] [2022-04-08 09:14:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:32,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:14:32,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:32,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:14:32,412 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:14:32,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:14:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:14:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:14:32,413 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:14:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,529 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-08 09:14:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:14:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:14:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:14:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-08 09:14:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:14:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-08 09:14:32,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-08 09:14:32,577 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:14:32,580 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:14:32,581 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:14:32,581 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:14:32,583 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:32,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:14:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:14:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-08 09:14:32,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:32,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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:14:32,591 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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:14:32,591 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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:14:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,593 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-08 09:14:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-08 09:14:32,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:32,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:32,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 24 states. [2022-04-08 09:14:32,594 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 24 states. [2022-04-08 09:14:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,596 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-08 09:14:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-08 09:14:32,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:32,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:32,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:32,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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:14:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-08 09:14:32,600 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-08 09:14:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:32,601 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-08 09:14:32,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:14:32,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 33 transitions. [2022-04-08 09:14:32,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-08 09:14:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:14:32,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:32,655 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:32,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:14:32,655 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 1 times [2022-04-08 09:14:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:32,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342763987] [2022-04-08 09:14:32,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:32,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 2 times [2022-04-08 09:14:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:32,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356001083] [2022-04-08 09:14:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:32,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:32,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(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(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 09:14:32,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 09:14:32,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-08 09:14:32,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:32,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(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(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 09:14:32,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 09:14:32,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-08 09:14:32,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret6 := main(); {368#true} is VALID [2022-04-08 09:14:32,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {368#true} is VALID [2022-04-08 09:14:32,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#true} assume !!(~x~0 % 4294967296 < 99); {368#true} is VALID [2022-04-08 09:14:32,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {373#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-08 09:14:32,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {369#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {369#false} is VALID [2022-04-08 09:14:32,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 09:14:32,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !(~x~0 % 4294967296 < 99); {369#false} is VALID [2022-04-08 09:14:32,752 INFO L272 TraceCheckUtils]: 18: Hoare triple {369#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {369#false} is VALID [2022-04-08 09:14:32,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#false} ~cond := #in~cond; {369#false} is VALID [2022-04-08 09:14:32,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#false} assume 0 == ~cond; {369#false} is VALID [2022-04-08 09:14:32,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 09:14:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356001083] [2022-04-08 09:14:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356001083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:32,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:32,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:32,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342763987] [2022-04-08 09:14:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342763987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:32,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960222627] [2022-04-08 09:14:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:32,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,776 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:14:32,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:14:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:14:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:14:32,777 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:32,926 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-04-08 09:14:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:14:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-08 09:14:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-08 09:14:32,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-08 09:14:33,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:33,013 INFO L225 Difference]: With dead ends: 51 [2022-04-08 09:14:33,013 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:14:33,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:14:33,016 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:33,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:14:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:14:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 09:14:33,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:33,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,033 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,035 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:33,040 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 09:14:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 09:14:33,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:33,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:33,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,041 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:33,044 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 09:14:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 09:14:33,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:33,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:33,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:33,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:14:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 09:14:33,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 22 [2022-04-08 09:14:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:33,049 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 09:14:33,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:33,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 09:14:33,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 09:14:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:14:33,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:33,099 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:33,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:14:33,100 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:33,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 622763737, now seen corresponding path program 1 times [2022-04-08 09:14:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411382232] [2022-04-08 09:14:33,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:33,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 622763737, now seen corresponding path program 2 times [2022-04-08 09:14:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:33,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808036077] [2022-04-08 09:14:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:33,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {629#(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(14, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-08 09:14:33,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-08 09:14:33,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {620#true} {620#true} #96#return; {620#true} is VALID [2022-04-08 09:14:33,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:33,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {629#(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(14, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-08 09:14:33,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-08 09:14:33,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #96#return; {620#true} is VALID [2022-04-08 09:14:33,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret6 := main(); {620#true} is VALID [2022-04-08 09:14:33,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {625#(= main_~x~0 0)} is VALID [2022-04-08 09:14:33,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {625#(= main_~x~0 0)} is VALID [2022-04-08 09:14:33,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(~x~0 % 4294967296 < 99); {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-08 09:14:33,449 INFO L272 TraceCheckUtils]: 18: Hoare triple {626#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {627#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:14:33,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {627#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {628#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:14:33,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {628#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-08 09:14:33,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-08 09:14:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:33,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:33,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808036077] [2022-04-08 09:14:33,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808036077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:33,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028220646] [2022-04-08 09:14:33,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:14:33,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:33,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:33,453 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:14:33,461 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:14:33,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:14:33,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:33,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 09:14:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:33,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:34,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-08 09:14:34,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(14, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-08 09:14:34,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-08 09:14:34,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #96#return; {620#true} is VALID [2022-04-08 09:14:34,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret6 := main(); {620#true} is VALID [2022-04-08 09:14:34,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {625#(= main_~x~0 0)} is VALID [2022-04-08 09:14:34,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {625#(= main_~x~0 0)} is VALID [2022-04-08 09:14:34,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {654#(= main_~x~0 1)} is VALID [2022-04-08 09:14:34,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(= main_~x~0 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {658#(= (+ main_~x~0 2) 1)} is VALID [2022-04-08 09:14:34,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#(= (+ main_~x~0 2) 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {654#(= main_~x~0 1)} is VALID [2022-04-08 09:14:34,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(= main_~x~0 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {658#(= (+ main_~x~0 2) 1)} is VALID [2022-04-08 09:14:34,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#(= (+ main_~x~0 2) 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {654#(= main_~x~0 1)} is VALID [2022-04-08 09:14:34,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {654#(= main_~x~0 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {671#(= main_~x~0 (- 3))} is VALID [2022-04-08 09:14:34,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {671#(= main_~x~0 (- 3))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {654#(= main_~x~0 1)} is VALID [2022-04-08 09:14:34,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {654#(= main_~x~0 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {678#(= (+ (- 2) main_~x~0) 1)} is VALID [2022-04-08 09:14:34,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#(= (+ (- 2) main_~x~0) 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {658#(= (+ main_~x~0 2) 1)} is VALID [2022-04-08 09:14:34,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {658#(= (+ main_~x~0 2) 1)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {685#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-08 09:14:34,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {685#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} assume !(~x~0 % 4294967296 < 99); {685#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} is VALID [2022-04-08 09:14:34,030 INFO L272 TraceCheckUtils]: 18: Hoare triple {685#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 5)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:14:34,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:14:34,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {621#false} is VALID [2022-04-08 09:14:34,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-08 09:14:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:34,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:34,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-08 09:14:34,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {621#false} is VALID [2022-04-08 09:14:34,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:14:34,642 INFO L272 TraceCheckUtils]: 18: Hoare triple {712#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:14:34,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {712#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:34,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {712#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:34,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#(<= 1 (mod main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {719#(<= 1 (mod main_~x~0 2))} is VALID [2022-04-08 09:14:34,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {747#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-08 09:14:34,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {747#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-08 09:14:34,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret6 := main(); {620#true} is VALID [2022-04-08 09:14:34,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #96#return; {620#true} is VALID [2022-04-08 09:14:34,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-08 09:14:34,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(14, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-08 09:14:34,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-08 09:14:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028220646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:34,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 17 [2022-04-08 09:14:34,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411382232] [2022-04-08 09:14:34,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411382232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:34,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:34,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:14:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979293541] [2022-04-08 09:14:34,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:34,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:34,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:34,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:34,681 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:14:34,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:14:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:14:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:14:34,682 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,083 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-08 09:14:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:14:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-08 09:14:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-08 09:14:35,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-08 09:14:35,143 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:14:35,144 INFO L225 Difference]: With dead ends: 51 [2022-04-08 09:14:35,144 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 09:14:35,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:14:35,145 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:35,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:14:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 09:14:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 09:14:35,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:35,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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:14:35,170 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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:14:35,171 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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:14:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,172 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 09:14:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 09:14:35,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:35,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:35,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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 46 states. [2022-04-08 09:14:35,173 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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 46 states. [2022-04-08 09:14:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,175 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 09:14:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 09:14:35,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:35,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:35,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:35,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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:14:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-08 09:14:35,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2022-04-08 09:14:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:35,178 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-08 09:14:35,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 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:14:35,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2022-04-08 09:14:35,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-08 09:14:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:14:35,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:35,247 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:35,267 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:14:35,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:35,456 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1231331367, now seen corresponding path program 1 times [2022-04-08 09:14:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:35,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549515457] [2022-04-08 09:14:35,459 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:35,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1231331367, now seen corresponding path program 2 times [2022-04-08 09:14:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:35,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077686338] [2022-04-08 09:14:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:35,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {1069#(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(14, 2);call #Ultimate.allocInit(12, 3); {1063#true} is VALID [2022-04-08 09:14:35,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-08 09:14:35,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1063#true} {1063#true} #96#return; {1063#true} is VALID [2022-04-08 09:14:35,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:35,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1069#(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(14, 2);call #Ultimate.allocInit(12, 3); {1063#true} is VALID [2022-04-08 09:14:35,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-08 09:14:35,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #96#return; {1063#true} is VALID [2022-04-08 09:14:35,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret6 := main(); {1063#true} is VALID [2022-04-08 09:14:35,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1063#true} is VALID [2022-04-08 09:14:35,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {1063#true} assume !!(~x~0 % 4294967296 < 99); {1063#true} is VALID [2022-04-08 09:14:35,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-08 09:14:35,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1068#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1064#false} is VALID [2022-04-08 09:14:35,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1064#false} is VALID [2022-04-08 09:14:35,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#false} assume !(~x~0 % 4294967296 < 99); {1064#false} is VALID [2022-04-08 09:14:35,507 INFO L272 TraceCheckUtils]: 18: Hoare triple {1064#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1064#false} is VALID [2022-04-08 09:14:35,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {1064#false} ~cond := #in~cond; {1064#false} is VALID [2022-04-08 09:14:35,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1064#false} assume 0 == ~cond; {1064#false} is VALID [2022-04-08 09:14:35,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-04-08 09:14:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:35,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077686338] [2022-04-08 09:14:35,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077686338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:35,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:35,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:35,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:35,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549515457] [2022-04-08 09:14:35,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549515457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:35,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:35,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:14:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873900319] [2022-04-08 09:14:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:35,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:35,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,526 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:14:35,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:14:35,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:14:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:14:35,527 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,644 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-08 09:14:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:14:35,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 09:14:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-08 09:14:35,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-08 09:14:35,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:35,703 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:14:35,703 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 09:14:35,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:14:35,704 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:35,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:14:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 09:14:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 09:14:35,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:35,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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:14:35,726 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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:14:35,726 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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:14:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,727 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-08 09:14:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-08 09:14:35,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:35,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:35,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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 46 states. [2022-04-08 09:14:35,728 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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 46 states. [2022-04-08 09:14:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:35,730 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-04-08 09:14:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-04-08 09:14:35,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:35,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:35,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:35,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 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:14:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-08 09:14:35,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 22 [2022-04-08 09:14:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:35,732 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-08 09:14:35,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:14:35,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-08 09:14:35,796 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:14:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-08 09:14:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:14:35,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:35,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:35,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 09:14:35,798 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1231370265, now seen corresponding path program 1 times [2022-04-08 09:14:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:35,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083345288] [2022-04-08 09:14:35,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:35,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1231370265, now seen corresponding path program 2 times [2022-04-08 09:14:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493674018] [2022-04-08 09:14:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:36,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#(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(14, 2);call #Ultimate.allocInit(12, 3); {1381#true} is VALID [2022-04-08 09:14:36,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#true} assume true; {1381#true} is VALID [2022-04-08 09:14:36,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} #96#return; {1381#true} is VALID [2022-04-08 09:14:36,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:36,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#(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(14, 2);call #Ultimate.allocInit(12, 3); {1381#true} is VALID [2022-04-08 09:14:36,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2022-04-08 09:14:36,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #96#return; {1381#true} is VALID [2022-04-08 09:14:36,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret6 := main(); {1381#true} is VALID [2022-04-08 09:14:36,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1386#(= main_~x~0 0)} is VALID [2022-04-08 09:14:36,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {1386#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1386#(= main_~x~0 0)} is VALID [2022-04-08 09:14:36,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1387#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:36,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1387#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1388#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:36,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1388#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1389#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:36,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1390#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:36,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1391#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:36,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1392#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:36,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1392#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1393#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:36,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1394#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:36,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1395#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:36,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {1395#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1396#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:14:36,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {1396#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {1382#false} is VALID [2022-04-08 09:14:36,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {1382#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1382#false} is VALID [2022-04-08 09:14:36,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} ~cond := #in~cond; {1382#false} is VALID [2022-04-08 09:14:36,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {1382#false} assume 0 == ~cond; {1382#false} is VALID [2022-04-08 09:14:36,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2022-04-08 09:14:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:36,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:36,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493674018] [2022-04-08 09:14:36,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493674018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:36,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281230661] [2022-04-08 09:14:36,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:14:36,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:36,050 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:14:36,075 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:14:36,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:14:36,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:36,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 09:14:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:36,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2022-04-08 09:14:36,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#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(14, 2);call #Ultimate.allocInit(12, 3); {1381#true} is VALID [2022-04-08 09:14:36,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2022-04-08 09:14:36,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #96#return; {1381#true} is VALID [2022-04-08 09:14:36,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret6 := main(); {1381#true} is VALID [2022-04-08 09:14:36,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1386#(= main_~x~0 0)} is VALID [2022-04-08 09:14:36,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {1386#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1386#(= main_~x~0 0)} is VALID [2022-04-08 09:14:36,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1387#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:36,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {1387#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1388#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:36,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1388#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1389#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:36,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1390#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:36,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1391#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:36,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1392#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:36,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {1392#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1393#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:36,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1394#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:36,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1395#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:36,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {1395#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1449#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:36,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {1449#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1382#false} is VALID [2022-04-08 09:14:36,458 INFO L272 TraceCheckUtils]: 18: Hoare triple {1382#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1382#false} is VALID [2022-04-08 09:14:36,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} ~cond := #in~cond; {1382#false} is VALID [2022-04-08 09:14:36,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {1382#false} assume 0 == ~cond; {1382#false} is VALID [2022-04-08 09:14:36,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2022-04-08 09:14:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:36,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:36,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {1382#false} assume !false; {1382#false} is VALID [2022-04-08 09:14:36,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {1382#false} assume 0 == ~cond; {1382#false} is VALID [2022-04-08 09:14:36,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} ~cond := #in~cond; {1382#false} is VALID [2022-04-08 09:14:36,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {1382#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1382#false} is VALID [2022-04-08 09:14:36,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1477#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {1382#false} is VALID [2022-04-08 09:14:36,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {1481#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1477#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-08 09:14:36,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1485#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1481#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 09:14:36,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {1489#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1485#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-08 09:14:36,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1489#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-08 09:14:36,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {1497#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1493#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-08 09:14:36,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1501#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1497#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-08 09:14:36,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1501#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-08 09:14:36,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1505#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-08 09:14:36,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1513#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1509#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-08 09:14:36,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1513#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-08 09:14:36,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1517#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:36,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1517#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:36,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret6 := main(); {1381#true} is VALID [2022-04-08 09:14:36,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #96#return; {1381#true} is VALID [2022-04-08 09:14:36,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2022-04-08 09:14:36,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#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(14, 2);call #Ultimate.allocInit(12, 3); {1381#true} is VALID [2022-04-08 09:14:36,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2022-04-08 09:14:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281230661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:36,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:36,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 09:14:36,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083345288] [2022-04-08 09:14:36,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083345288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:36,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:36,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 09:14:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537151712] [2022-04-08 09:14:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:36,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:36,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:36,848 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:14:36,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 09:14:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 09:14:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:14:36,849 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:37,553 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-08 09:14:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 09:14:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-08 09:14:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-08 09:14:37,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2022-04-08 09:14:37,606 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:14:37,607 INFO L225 Difference]: With dead ends: 61 [2022-04-08 09:14:37,607 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 09:14:37,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 09:14:37,608 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:37,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 61 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:14:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 09:14:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-08 09:14:37,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:37,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,649 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,649 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:37,652 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-04-08 09:14:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-08 09:14:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:37,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,654 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:37,657 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-04-08 09:14:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-08 09:14:37,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:37,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:37,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:37,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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:14:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-08 09:14:37,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 22 [2022-04-08 09:14:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:37,660 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-08 09:14:37,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:14:37,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-08 09:14:37,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 09:14:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 09:14:37,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:37,734 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:37,761 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:14:37,947 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,SelfDestructingSolverStorable5 [2022-04-08 09:14:37,947 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash -528285250, now seen corresponding path program 3 times [2022-04-08 09:14:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:37,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538552368] [2022-04-08 09:14:37,961 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:37,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash -528285250, now seen corresponding path program 4 times [2022-04-08 09:14:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:37,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850350587] [2022-04-08 09:14:37,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:38,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {1918#(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(14, 2);call #Ultimate.allocInit(12, 3); {1907#true} is VALID [2022-04-08 09:14:38,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-08 09:14:38,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #96#return; {1907#true} is VALID [2022-04-08 09:14:38,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:38,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1918#(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(14, 2);call #Ultimate.allocInit(12, 3); {1907#true} is VALID [2022-04-08 09:14:38,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-08 09:14:38,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #96#return; {1907#true} is VALID [2022-04-08 09:14:38,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret6 := main(); {1907#true} is VALID [2022-04-08 09:14:38,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1912#(= main_~x~0 0)} is VALID [2022-04-08 09:14:38,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {1912#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1912#(= main_~x~0 0)} is VALID [2022-04-08 09:14:38,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1915#(and (<= (+ main_~x~0 3) 0) (<= 0 (+ main_~x~0 3)))} is VALID [2022-04-08 09:14:38,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {1915#(and (<= (+ main_~x~0 3) 0) (<= 0 (+ main_~x~0 3)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1916#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:14:38,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {1916#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1917#(and (<= (+ (div main_~x~0 4294967296) 1) 0) (<= 0 (+ 5 main_~x~0)))} is VALID [2022-04-08 09:14:38,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {1917#(and (<= (+ (div main_~x~0 4294967296) 1) 0) (<= 0 (+ 5 main_~x~0)))} assume !!(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {1908#false} assume !(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L272 TraceCheckUtils]: 29: Hoare triple {1908#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {1908#false} ~cond := #in~cond; {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {1908#false} assume 0 == ~cond; {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-04-08 09:14:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850350587] [2022-04-08 09:14:38,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850350587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659837156] [2022-04-08 09:14:38,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:14:38,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:38,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:38,139 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:14:38,140 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:14:38,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:14:38,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:38,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 09:14:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:38,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:38,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2022-04-08 09:14:38,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#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(14, 2);call #Ultimate.allocInit(12, 3); {1907#true} is VALID [2022-04-08 09:14:38,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-08 09:14:38,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #96#return; {1907#true} is VALID [2022-04-08 09:14:38,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret6 := main(); {1907#true} is VALID [2022-04-08 09:14:38,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1912#(= main_~x~0 0)} is VALID [2022-04-08 09:14:38,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {1912#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1912#(= main_~x~0 0)} is VALID [2022-04-08 09:14:38,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1915#(and (<= (+ main_~x~0 3) 0) (<= 0 (+ main_~x~0 3)))} is VALID [2022-04-08 09:14:38,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1915#(and (<= (+ main_~x~0 3) 0) (<= 0 (+ main_~x~0 3)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-08 09:14:38,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {1913#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1916#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-08 09:14:38,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {1916#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-08 09:14:38,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (<= 0 (+ main_~x~0 1)) (<= (+ main_~x~0 1) 0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1970#(and (<= 0 (+ 5 main_~x~0)) (<= (+ 5 main_~x~0) 0))} is VALID [2022-04-08 09:14:38,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {1970#(and (<= 0 (+ 5 main_~x~0)) (<= (+ 5 main_~x~0) 0))} assume !!(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1908#false} is VALID [2022-04-08 09:14:38,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {1908#false} assume !(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L272 TraceCheckUtils]: 29: Hoare triple {1908#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {1908#false} ~cond := #in~cond; {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {1908#false} assume 0 == ~cond; {1908#false} is VALID [2022-04-08 09:14:38,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-04-08 09:14:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:38,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:38,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-04-08 09:14:38,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1908#false} assume 0 == ~cond; {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {1908#false} ~cond := #in~cond; {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L272 TraceCheckUtils]: 29: Hoare triple {1908#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {1908#false} assume !(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {1908#false} is VALID [2022-04-08 09:14:38,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {1908#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1908#false} is VALID [2022-04-08 09:14:38,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2064#(not (< (mod main_~x~0 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {1908#false} is VALID [2022-04-08 09:14:38,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {2064#(not (< (mod main_~x~0 4294967296) 99))} is VALID [2022-04-08 09:14:38,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {2072#(not (< (mod (+ 4294967288 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2072#(not (< (mod (+ 4294967288 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {2080#(not (< (mod (+ main_~x~0 4294967294) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {2080#(not (< (mod (+ main_~x~0 4294967294) 4294967296) 99))} is VALID [2022-04-08 09:14:38,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {2068#(not (< (mod (+ 4294967292 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {2099#(not (< (mod (+ 4294967291 main_~x~0) 4294967296) 99))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2076#(not (< (mod (+ 4294967290 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {2099#(not (< (mod (+ 4294967291 main_~x~0) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {2099#(not (< (mod (+ 4294967291 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2099#(not (< (mod (+ 4294967291 main_~x~0) 4294967296) 99))} is VALID [2022-04-08 09:14:38,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret6 := main(); {1907#true} is VALID [2022-04-08 09:14:38,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #96#return; {1907#true} is VALID [2022-04-08 09:14:38,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-08 09:14:38,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#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(14, 2);call #Ultimate.allocInit(12, 3); {1907#true} is VALID [2022-04-08 09:14:38,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2022-04-08 09:14:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:38,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659837156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:38,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:38,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 09:14:38,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:38,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538552368] [2022-04-08 09:14:38,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538552368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:38,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:38,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:14:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333620768] [2022-04-08 09:14:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 33 [2022-04-08 09:14:38,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:38,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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:14:38,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:38,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:14:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:14:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:14:38,820 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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:14:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:39,182 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-08 09:14:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:14:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 33 [2022-04-08 09:14:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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:14:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 09:14:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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:14:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 09:14:39,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-08 09:14:39,232 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:14:39,233 INFO L225 Difference]: With dead ends: 60 [2022-04-08 09:14:39,233 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 09:14:39,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:14:39,234 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:39,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:14:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 09:14:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 09:14:39,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:39,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:14:39,254 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:14:39,254 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:14:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:39,255 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:14:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:14:39,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:39,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:39,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-08 09:14:39,256 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 34 states. [2022-04-08 09:14:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:39,257 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 09:14:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:14:39,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:39,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:39,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:39,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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:14:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-08 09:14:39,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 33 [2022-04-08 09:14:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:39,260 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-08 09:14:39,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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:14:39,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-08 09:14:39,292 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:14:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 09:14:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 09:14:39,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:39,293 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:39,321 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:14:39,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:39,517 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1325221442, now seen corresponding path program 3 times [2022-04-08 09:14:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:39,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515994564] [2022-04-08 09:14:39,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:39,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1325221442, now seen corresponding path program 4 times [2022-04-08 09:14:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:39,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450221605] [2022-04-08 09:14:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:39,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {2417#(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(14, 2);call #Ultimate.allocInit(12, 3); {2391#true} is VALID [2022-04-08 09:14:39,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {2391#true} assume true; {2391#true} is VALID [2022-04-08 09:14:39,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2391#true} {2391#true} #96#return; {2391#true} is VALID [2022-04-08 09:14:39,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {2391#true} call ULTIMATE.init(); {2417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:39,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2417#(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(14, 2);call #Ultimate.allocInit(12, 3); {2391#true} is VALID [2022-04-08 09:14:39,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2391#true} assume true; {2391#true} is VALID [2022-04-08 09:14:39,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2391#true} {2391#true} #96#return; {2391#true} is VALID [2022-04-08 09:14:39,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2391#true} call #t~ret6 := main(); {2391#true} is VALID [2022-04-08 09:14:39,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {2391#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2396#(= main_~x~0 0)} is VALID [2022-04-08 09:14:39,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2396#(= main_~x~0 0)} is VALID [2022-04-08 09:14:39,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:39,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:39,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2399#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:39,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {2399#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2400#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:39,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {2400#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2401#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:39,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {2401#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2402#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:39,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {2402#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2403#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:39,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {2403#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2404#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:39,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {2404#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2405#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:39,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {2405#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2406#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:39,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {2406#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2406#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:39,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {2406#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2407#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-08 09:14:40,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {2407#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2408#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-08 09:14:40,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {2408#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2409#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-08 09:14:40,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {2409#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2410#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-08 09:14:40,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {2410#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2411#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-08 09:14:40,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {2411#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2412#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-08 09:14:40,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {2412#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2413#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-08 09:14:40,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {2413#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2414#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-08 09:14:40,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {2414#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2415#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-08 09:14:40,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2416#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-08 09:14:40,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {2416#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !(~x~0 % 4294967296 < 99); {2392#false} is VALID [2022-04-08 09:14:40,007 INFO L272 TraceCheckUtils]: 29: Hoare triple {2392#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2392#false} is VALID [2022-04-08 09:14:40,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {2392#false} ~cond := #in~cond; {2392#false} is VALID [2022-04-08 09:14:40,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {2392#false} assume 0 == ~cond; {2392#false} is VALID [2022-04-08 09:14:40,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {2392#false} assume !false; {2392#false} is VALID [2022-04-08 09:14:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450221605] [2022-04-08 09:14:40,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450221605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442988488] [2022-04-08 09:14:40,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:14:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:40,009 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:14:40,019 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:14:40,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:14:40,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:40,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-08 09:14:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:40,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:41,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {2391#true} call ULTIMATE.init(); {2391#true} is VALID [2022-04-08 09:14:41,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2391#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(14, 2);call #Ultimate.allocInit(12, 3); {2391#true} is VALID [2022-04-08 09:14:41,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2391#true} assume true; {2391#true} is VALID [2022-04-08 09:14:41,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2391#true} {2391#true} #96#return; {2391#true} is VALID [2022-04-08 09:14:41,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2391#true} call #t~ret6 := main(); {2391#true} is VALID [2022-04-08 09:14:41,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {2391#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2396#(= main_~x~0 0)} is VALID [2022-04-08 09:14:41,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2396#(= main_~x~0 0)} is VALID [2022-04-08 09:14:41,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2442#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} is VALID [2022-04-08 09:14:41,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {2442#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2446#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-08 09:14:41,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {2446#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2450#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {2450#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2454#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {2454#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2458#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} is VALID [2022-04-08 09:14:41,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {2458#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 6)) 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2462#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {2462#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2466#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(and (= 12 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2470#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} is VALID [2022-04-08 09:14:41,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {2470#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 12))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2474#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {2474#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2478#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {2478#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {2478#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {2478#(and (= main_~x~0 20) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2485#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {2485#(and (= 20 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2489#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {2489#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2493#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-08 09:14:41,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {2493#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2497#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {2497#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2501#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {2501#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2505#(and (= (+ main_~x~0 (- 4)) 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {2505#(and (= (+ main_~x~0 (- 4)) 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2509#(and (<= (mod main_~y~0 2) 0) (= 28 (+ main_~x~0 (- 6))))} is VALID [2022-04-08 09:14:41,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {2509#(and (<= (mod main_~y~0 2) 0) (= 28 (+ main_~x~0 (- 6))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2513#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-08 09:14:41,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {2513#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2517#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {2517#(and (= main_~x~0 38) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2521#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {2521#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {2521#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:14:41,103 INFO L272 TraceCheckUtils]: 29: Hoare triple {2521#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:14:41,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {2528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:14:41,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2392#false} is VALID [2022-04-08 09:14:41,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2392#false} assume !false; {2392#false} is VALID [2022-04-08 09:14:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:41,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:41,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {2392#false} assume !false; {2392#false} is VALID [2022-04-08 09:14:41,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {2532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2392#false} is VALID [2022-04-08 09:14:41,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {2528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:14:41,551 INFO L272 TraceCheckUtils]: 29: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:14:41,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2615#(<= (mod main_~x~0 2) 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2548#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-08 09:14:41,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {2615#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {2615#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:14:41,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2391#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2615#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-08 09:14:41,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {2391#true} call #t~ret6 := main(); {2391#true} is VALID [2022-04-08 09:14:41,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2391#true} {2391#true} #96#return; {2391#true} is VALID [2022-04-08 09:14:41,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {2391#true} assume true; {2391#true} is VALID [2022-04-08 09:14:41,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2391#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(14, 2);call #Ultimate.allocInit(12, 3); {2391#true} is VALID [2022-04-08 09:14:41,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {2391#true} call ULTIMATE.init(); {2391#true} is VALID [2022-04-08 09:14:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 09:14:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442988488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:41,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 6] total 48 [2022-04-08 09:14:41,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515994564] [2022-04-08 09:14:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515994564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:41,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 09:14:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983763736] [2022-04-08 09:14:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-08 09:14:41,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:41,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:14:41,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:41,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 09:14:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 09:14:41,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2044, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 09:14:41,608 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:14:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:42,816 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 09:14:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 09:14:42,816 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-08 09:14:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:14:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2022-04-08 09:14:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:14:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2022-04-08 09:14:42,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 51 transitions. [2022-04-08 09:14:42,872 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:14:42,873 INFO L225 Difference]: With dead ends: 51 [2022-04-08 09:14:42,873 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 09:14:42,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=4336, Unknown=0, NotChecked=0, Total=4692 [2022-04-08 09:14:42,875 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:42,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 09:14:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 09:14:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 09:14:42,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:42,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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:14:42,906 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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:14:42,906 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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:14:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:42,908 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:14:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 09:14:42,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:42,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:42,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 46 states. [2022-04-08 09:14:42,909 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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 46 states. [2022-04-08 09:14:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:42,910 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 09:14:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 09:14:42,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:42,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:42,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:42,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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:14:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-08 09:14:42,912 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 33 [2022-04-08 09:14:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:42,912 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-08 09:14:42,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:14:42,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-08 09:14:42,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 09:14:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 09:14:42,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:42,981 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:43,006 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:14:43,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:43,181 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash -820367623, now seen corresponding path program 5 times [2022-04-08 09:14:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:43,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104878599] [2022-04-08 09:14:43,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:43,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -820367623, now seen corresponding path program 6 times [2022-04-08 09:14:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:43,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325447561] [2022-04-08 09:14:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:43,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {3001#(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(14, 2);call #Ultimate.allocInit(12, 3); {2965#true} is VALID [2022-04-08 09:14:43,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 09:14:43,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2965#true} {2965#true} #96#return; {2965#true} is VALID [2022-04-08 09:14:43,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {3001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:43,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {3001#(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(14, 2);call #Ultimate.allocInit(12, 3); {2965#true} is VALID [2022-04-08 09:14:43,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 09:14:43,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #96#return; {2965#true} is VALID [2022-04-08 09:14:43,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret6 := main(); {2965#true} is VALID [2022-04-08 09:14:43,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2970#(= main_~x~0 0)} is VALID [2022-04-08 09:14:43,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {2970#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2970#(= main_~x~0 0)} is VALID [2022-04-08 09:14:43,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:43,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2972#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:43,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {2972#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2973#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:43,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2974#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:43,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2975#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:43,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {2975#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2976#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:43,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {2976#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2977#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:43,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2978#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:43,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2979#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:43,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {2979#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:43,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:43,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2981#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-08 09:14:43,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {2981#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2982#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-08 09:14:43,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {2982#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2983#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-08 09:14:43,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2984#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-08 09:14:43,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2985#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-08 09:14:43,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {2985#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2986#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-08 09:14:43,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {2986#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2987#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-08 09:14:43,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {2987#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2988#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-08 09:14:43,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {2988#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2989#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-08 09:14:43,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {2989#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:43,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:43,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2991#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-08 09:14:43,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {2991#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2992#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-08 09:14:43,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2993#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-08 09:14:43,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {2993#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2994#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-08 09:14:43,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {2994#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2995#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-08 09:14:43,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {2995#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2996#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-08 09:14:43,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {2996#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2997#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-08 09:14:43,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {2997#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2998#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-08 09:14:43,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {2998#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2999#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-08 09:14:43,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {2999#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3000#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:14:43,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {3000#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {2966#false} is VALID [2022-04-08 09:14:43,952 INFO L272 TraceCheckUtils]: 40: Hoare triple {2966#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2966#false} is VALID [2022-04-08 09:14:43,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {2966#false} ~cond := #in~cond; {2966#false} is VALID [2022-04-08 09:14:43,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {2966#false} assume 0 == ~cond; {2966#false} is VALID [2022-04-08 09:14:43,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-08 09:14:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325447561] [2022-04-08 09:14:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325447561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:43,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849731895] [2022-04-08 09:14:43,953 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:14:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:43,954 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:14:43,955 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:14:44,003 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:14:44,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:44,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-08 09:14:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:44,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:44,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-08 09:14:44,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(14, 2);call #Ultimate.allocInit(12, 3); {2965#true} is VALID [2022-04-08 09:14:44,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 09:14:44,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #96#return; {2965#true} is VALID [2022-04-08 09:14:44,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret6 := main(); {2965#true} is VALID [2022-04-08 09:14:44,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2970#(= main_~x~0 0)} is VALID [2022-04-08 09:14:44,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {2970#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {2970#(= main_~x~0 0)} is VALID [2022-04-08 09:14:44,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:44,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2972#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:44,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {2972#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2973#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:44,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2974#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:44,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {2974#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2975#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:44,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {2975#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2976#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:44,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {2976#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2977#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:44,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2978#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:44,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2979#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:44,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {2979#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:44,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:44,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {2980#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2981#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-08 09:14:44,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {2981#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2982#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-08 09:14:44,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {2982#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2983#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-08 09:14:44,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2984#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-08 09:14:44,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2985#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-08 09:14:44,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2985#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2986#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-08 09:14:44,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {2986#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2987#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-08 09:14:44,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {2987#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2988#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-08 09:14:44,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {2988#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2989#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-08 09:14:44,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {2989#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:44,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:44,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {2990#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2991#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-08 09:14:44,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {2991#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2992#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-08 09:14:44,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2993#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-08 09:14:44,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {2993#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2994#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-08 09:14:44,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {2994#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2995#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-08 09:14:44,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {2995#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2996#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-08 09:14:44,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {2996#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2997#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-08 09:14:44,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {2997#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2998#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-08 09:14:44,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {2998#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2999#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-08 09:14:44,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {2999#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3119#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-08 09:14:44,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {3119#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2966#false} is VALID [2022-04-08 09:14:44,564 INFO L272 TraceCheckUtils]: 40: Hoare triple {2966#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2966#false} is VALID [2022-04-08 09:14:44,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {2966#false} ~cond := #in~cond; {2966#false} is VALID [2022-04-08 09:14:44,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {2966#false} assume 0 == ~cond; {2966#false} is VALID [2022-04-08 09:14:44,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-08 09:14:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:44,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:46,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-08 09:14:46,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {2966#false} assume 0 == ~cond; {2966#false} is VALID [2022-04-08 09:14:46,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {2966#false} ~cond := #in~cond; {2966#false} is VALID [2022-04-08 09:14:46,224 INFO L272 TraceCheckUtils]: 40: Hoare triple {2966#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2966#false} is VALID [2022-04-08 09:14:46,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {3147#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {2966#false} is VALID [2022-04-08 09:14:46,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {3151#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3147#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-08 09:14:46,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {3155#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3151#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 09:14:46,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {3159#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3155#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-08 09:14:46,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {3163#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3159#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-08 09:14:46,229 INFO L290 TraceCheckUtils]: 34: Hoare triple {3167#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3163#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-08 09:14:46,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {3171#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3167#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-08 09:14:46,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {3175#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3171#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-08 09:14:46,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {3179#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3175#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-08 09:14:46,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {3183#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3179#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-08 09:14:46,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {3187#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3183#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-08 09:14:46,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {3187#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3187#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:46,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {3194#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3187#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:46,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {3198#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3194#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-08 09:14:46,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3198#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-08 09:14:46,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {3206#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3202#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-08 09:14:46,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {3210#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3206#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-08 09:14:46,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {3214#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3210#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3214#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3218#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-08 09:14:46,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {3226#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3222#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-08 09:14:46,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {3230#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3226#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-08 09:14:46,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {3230#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3230#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {3237#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3230#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {3241#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3237#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3241#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {3249#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3245#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-08 09:14:46,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {3253#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3249#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-08 09:14:46,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {3257#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3253#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-08 09:14:46,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {3261#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3257#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-08 09:14:46,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {3265#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3261#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-08 09:14:46,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {3269#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3265#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:46,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {3273#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3269#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-08 09:14:46,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {3273#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3273#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-08 09:14:46,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3273#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-08 09:14:46,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret6 := main(); {2965#true} is VALID [2022-04-08 09:14:46,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #96#return; {2965#true} is VALID [2022-04-08 09:14:46,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 09:14:46,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(14, 2);call #Ultimate.allocInit(12, 3); {2965#true} is VALID [2022-04-08 09:14:46,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-08 09:14:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:46,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849731895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:46,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:46,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-08 09:14:46,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:46,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104878599] [2022-04-08 09:14:46,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104878599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:46,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 09:14:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370870542] [2022-04-08 09:14:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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 44 [2022-04-08 09:14:46,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:46,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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:14:46,284 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:14:46,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 09:14:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 09:14:46,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=3215, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 09:14:46,287 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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:14:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:48,604 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-08 09:14:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 09:14:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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 44 [2022-04-08 09:14:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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:14:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 62 transitions. [2022-04-08 09:14:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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:14:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 62 transitions. [2022-04-08 09:14:48,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 62 transitions. [2022-04-08 09:14:48,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:48,670 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:14:48,670 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 09:14:48,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2154, Invalid=7158, Unknown=0, NotChecked=0, Total=9312 [2022-04-08 09:14:48,673 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:48,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 09:14:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 09:14:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-08 09:14:48,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:48,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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:14:48,717 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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:14:48,717 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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:14:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:48,718 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 09:14:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 09:14:48,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:48,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:48,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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 57 states. [2022-04-08 09:14:48,719 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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 57 states. [2022-04-08 09:14:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:48,721 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-08 09:14:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-08 09:14:48,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:48,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:48,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:48,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 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:14:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-08 09:14:48,723 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 44 [2022-04-08 09:14:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:48,723 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-08 09:14:48,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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:14:48,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-08 09:14:48,782 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:14:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-08 09:14:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 09:14:48,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:48,783 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:48,811 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:14:48,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:48,999 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1020741922, now seen corresponding path program 7 times [2022-04-08 09:14:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [31058621] [2022-04-08 09:14:49,011 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:49,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1020741922, now seen corresponding path program 8 times [2022-04-08 09:14:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527914242] [2022-04-08 09:14:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:50,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {3755#(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(14, 2);call #Ultimate.allocInit(12, 3); {3709#true} is VALID [2022-04-08 09:14:50,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-08 09:14:50,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3709#true} {3709#true} #96#return; {3709#true} is VALID [2022-04-08 09:14:50,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3709#true} call ULTIMATE.init(); {3755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:50,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#(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(14, 2);call #Ultimate.allocInit(12, 3); {3709#true} is VALID [2022-04-08 09:14:50,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-08 09:14:50,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3709#true} {3709#true} #96#return; {3709#true} is VALID [2022-04-08 09:14:50,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {3709#true} call #t~ret6 := main(); {3709#true} is VALID [2022-04-08 09:14:50,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {3709#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3714#(= main_~x~0 0)} is VALID [2022-04-08 09:14:50,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3714#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3714#(= main_~x~0 0)} is VALID [2022-04-08 09:14:50,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {3714#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3715#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:50,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {3715#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3716#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:50,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {3716#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3717#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:50,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3717#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3718#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:50,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {3718#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3719#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:50,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3720#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:50,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {3720#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3721#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:50,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {3721#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3722#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:50,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {3722#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3723#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:50,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {3723#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:50,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:50,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3725#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-08 09:14:50,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {3725#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3726#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-08 09:14:50,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3726#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3727#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-08 09:14:50,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3727#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3728#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-08 09:14:50,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {3728#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3729#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-08 09:14:50,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {3729#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3730#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-08 09:14:50,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {3730#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3731#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-08 09:14:50,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {3731#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3732#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-08 09:14:50,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3733#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-08 09:14:50,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {3733#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:50,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:50,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3735#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-08 09:14:50,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {3735#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3736#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-08 09:14:50,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {3736#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3737#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-08 09:14:50,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {3737#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3738#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-08 09:14:50,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {3738#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3739#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-08 09:14:50,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {3739#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3740#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-08 09:14:50,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3741#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-08 09:14:50,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {3741#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3742#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-08 09:14:50,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {3742#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3743#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-08 09:14:50,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {3743#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-08 09:14:50,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-08 09:14:50,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3745#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-08 09:14:50,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {3745#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3746#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-08 09:14:50,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {3746#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3747#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-08 09:14:50,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {3747#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3748#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-08 09:14:50,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {3748#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3749#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-08 09:14:50,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {3749#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3750#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-08 09:14:50,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {3750#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3751#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-08 09:14:50,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {3751#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3752#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-08 09:14:50,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {3752#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3753#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-08 09:14:50,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {3753#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3754#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} is VALID [2022-04-08 09:14:50,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {3754#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 99); {3710#false} is VALID [2022-04-08 09:14:50,253 INFO L272 TraceCheckUtils]: 51: Hoare triple {3710#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3710#false} is VALID [2022-04-08 09:14:50,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {3710#false} ~cond := #in~cond; {3710#false} is VALID [2022-04-08 09:14:50,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {3710#false} assume 0 == ~cond; {3710#false} is VALID [2022-04-08 09:14:50,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#false} assume !false; {3710#false} is VALID [2022-04-08 09:14:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527914242] [2022-04-08 09:14:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527914242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045330988] [2022-04-08 09:14:50,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:14:50,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:50,256 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:14:50,257 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:14:50,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:14:50,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:50,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-08 09:14:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:50,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:14:50,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {3709#true} call ULTIMATE.init(); {3709#true} is VALID [2022-04-08 09:14:50,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3709#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(14, 2);call #Ultimate.allocInit(12, 3); {3709#true} is VALID [2022-04-08 09:14:50,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-08 09:14:50,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3709#true} {3709#true} #96#return; {3709#true} is VALID [2022-04-08 09:14:50,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {3709#true} call #t~ret6 := main(); {3709#true} is VALID [2022-04-08 09:14:50,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {3709#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3714#(= main_~x~0 0)} is VALID [2022-04-08 09:14:50,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {3714#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3714#(= main_~x~0 0)} is VALID [2022-04-08 09:14:50,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {3714#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3715#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 09:14:50,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {3715#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3716#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 09:14:50,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {3716#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3717#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-08 09:14:50,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {3717#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3718#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-08 09:14:50,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {3718#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3719#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-08 09:14:50,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3720#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-08 09:14:50,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {3720#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3721#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-08 09:14:50,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {3721#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3722#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-08 09:14:51,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {3722#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3723#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-08 09:14:51,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {3723#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:51,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-08 09:14:51,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3724#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3725#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-08 09:14:51,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {3725#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3726#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-08 09:14:51,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {3726#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3727#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-08 09:14:51,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {3727#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3728#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-08 09:14:51,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {3728#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3729#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-08 09:14:51,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {3729#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3730#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-08 09:14:51,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {3730#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3731#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-08 09:14:51,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {3731#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3732#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-08 09:14:51,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3733#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-08 09:14:51,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {3733#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:51,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-08 09:14:51,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {3734#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3735#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-08 09:14:51,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {3735#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3736#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-08 09:14:51,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {3736#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3737#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-08 09:14:51,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {3737#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3738#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-08 09:14:51,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {3738#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3739#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-08 09:14:51,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {3739#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3740#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-08 09:14:51,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3741#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-08 09:14:51,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {3741#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3742#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-08 09:14:51,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {3742#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3743#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-08 09:14:51,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {3743#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-08 09:14:51,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-08 09:14:51,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {3744#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3745#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-08 09:14:51,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {3745#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3746#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-08 09:14:51,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {3746#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3747#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-08 09:14:51,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {3747#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3748#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-08 09:14:51,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {3748#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3749#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-08 09:14:51,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {3749#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3750#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-08 09:14:51,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {3750#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3751#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-08 09:14:51,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {3751#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3752#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-08 09:14:51,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {3752#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3753#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-08 09:14:51,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {3753#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3906#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-08 09:14:51,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {3906#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 99); {3710#false} is VALID [2022-04-08 09:14:51,024 INFO L272 TraceCheckUtils]: 51: Hoare triple {3710#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3710#false} is VALID [2022-04-08 09:14:51,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {3710#false} ~cond := #in~cond; {3710#false} is VALID [2022-04-08 09:14:51,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {3710#false} assume 0 == ~cond; {3710#false} is VALID [2022-04-08 09:14:51,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#false} assume !false; {3710#false} is VALID [2022-04-08 09:14:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:51,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:14:53,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#false} assume !false; {3710#false} is VALID [2022-04-08 09:14:53,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {3710#false} assume 0 == ~cond; {3710#false} is VALID [2022-04-08 09:14:53,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {3710#false} ~cond := #in~cond; {3710#false} is VALID [2022-04-08 09:14:53,366 INFO L272 TraceCheckUtils]: 51: Hoare triple {3710#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3710#false} is VALID [2022-04-08 09:14:53,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {3934#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {3710#false} is VALID [2022-04-08 09:14:53,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {3938#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3934#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-08 09:14:53,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {3942#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3938#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 09:14:53,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {3946#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3942#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-08 09:14:53,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {3950#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3946#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-08 09:14:53,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {3954#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3950#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-08 09:14:53,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {3958#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3954#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-08 09:14:53,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {3962#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3958#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-08 09:14:53,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3962#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-08 09:14:53,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {3970#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3966#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-08 09:14:53,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {3974#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3970#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-08 09:14:53,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {3974#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {3974#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:53,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {3981#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3974#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-08 09:14:53,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {3985#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3981#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-08 09:14:53,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {3989#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3985#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-08 09:14:53,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {3993#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3989#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-08 09:14:53,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3993#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-08 09:14:53,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {4001#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3997#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {4005#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4001#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {4009#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4005#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-08 09:14:53,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {4013#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4009#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-08 09:14:53,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {4017#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4013#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-08 09:14:53,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {4017#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4017#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {4024#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4017#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {4028#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4024#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {4032#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4028#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {4036#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4032#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-08 09:14:53,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {4040#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4036#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-08 09:14:53,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4044#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4040#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-08 09:14:53,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {4048#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4044#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-08 09:14:53,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {4052#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4048#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-08 09:14:53,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {4056#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4052#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {4060#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4056#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-08 09:14:53,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {4060#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4060#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-08 09:14:53,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {4067#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4060#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-08 09:14:53,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {4071#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4067#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-08 09:14:53,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {4075#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4071#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4075#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {4083#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4079#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4083#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-08 09:14:53,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {4091#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4087#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {4095#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4091#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-08 09:14:53,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {4099#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4095#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-08 09:14:53,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {4103#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4099#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-08 09:14:53,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {4103#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4103#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-08 09:14:53,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {3709#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4103#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-08 09:14:53,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {3709#true} call #t~ret6 := main(); {3709#true} is VALID [2022-04-08 09:14:53,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3709#true} {3709#true} #96#return; {3709#true} is VALID [2022-04-08 09:14:53,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {3709#true} assume true; {3709#true} is VALID [2022-04-08 09:14:53,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {3709#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(14, 2);call #Ultimate.allocInit(12, 3); {3709#true} is VALID [2022-04-08 09:14:53,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {3709#true} call ULTIMATE.init(); {3709#true} is VALID [2022-04-08 09:14:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:14:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045330988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:14:53,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:14:53,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-08 09:14:53,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:14:53,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [31058621] [2022-04-08 09:14:53,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [31058621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:14:53,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:14:53,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-08 09:14:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53562072] [2022-04-08 09:14:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:14:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:53,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:14:53,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:53,453 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:14:53,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-08 09:14:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-08 09:14:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=5905, Unknown=0, NotChecked=0, Total=7310 [2022-04-08 09:14:53,456 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:57,457 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-08 09:14:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 09:14:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:14:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2022-04-08 09:14:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2022-04-08 09:14:57,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 73 transitions. [2022-04-08 09:14:57,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:14:57,528 INFO L225 Difference]: With dead ends: 73 [2022-04-08 09:14:57,528 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 09:14:57,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2834, Invalid=13168, Unknown=0, NotChecked=0, Total=16002 [2022-04-08 09:14:57,533 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 09:14:57,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 09:14:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 09:14:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-08 09:14:57,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:14:57,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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:14:57,590 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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:14:57,590 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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:14:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:57,592 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-08 09:14:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-08 09:14:57,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:57,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:57,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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 68 states. [2022-04-08 09:14:57,592 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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 68 states. [2022-04-08 09:14:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:14:57,594 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-08 09:14:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-08 09:14:57,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:14:57,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:14:57,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:14:57,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:14:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 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:14:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-08 09:14:57,596 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 55 [2022-04-08 09:14:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:14:57,596 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-08 09:14:57,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 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:14:57,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-08 09:14:57,659 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:14:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-08 09:14:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 09:14:57,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:14:57,660 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:14:57,678 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:14:57,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:57,868 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:14:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:14:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash -361185831, now seen corresponding path program 9 times [2022-04-08 09:14:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:14:57,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941611762] [2022-04-08 09:14:57,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:14:57,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:14:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash -361185831, now seen corresponding path program 10 times [2022-04-08 09:14:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:14:57,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134894531] [2022-04-08 09:14:57,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:14:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:14:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:14:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:58,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {4635#(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(14, 2);call #Ultimate.allocInit(12, 3); {4625#true} is VALID [2022-04-08 09:14:58,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {4625#true} assume true; {4625#true} is VALID [2022-04-08 09:14:58,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4625#true} {4625#true} #96#return; {4625#true} is VALID [2022-04-08 09:14:58,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {4625#true} call ULTIMATE.init(); {4635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:14:58,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {4635#(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(14, 2);call #Ultimate.allocInit(12, 3); {4625#true} is VALID [2022-04-08 09:14:58,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {4625#true} assume true; {4625#true} is VALID [2022-04-08 09:14:58,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4625#true} {4625#true} #96#return; {4625#true} is VALID [2022-04-08 09:14:58,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {4625#true} call #t~ret6 := main(); {4625#true} is VALID [2022-04-08 09:14:58,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {4625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4630#(= main_~x~0 0)} is VALID [2022-04-08 09:14:58,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {4630#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4630#(= main_~x~0 0)} is VALID [2022-04-08 09:14:58,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {4630#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume !!(~x~0 % 4294967296 < 99); {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,650 INFO L290 TraceCheckUtils]: 55: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} is VALID [2022-04-08 09:14:58,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {4631#(and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) (div main_~y~0 2)) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* (div main_~y~0 2) 2)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:14:58,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:14:58,657 INFO L272 TraceCheckUtils]: 62: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:14:58,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4634#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:14:58,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {4634#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4626#false} is VALID [2022-04-08 09:14:58,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {4626#false} assume !false; {4626#false} is VALID [2022-04-08 09:14:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-08 09:14:58,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:14:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134894531] [2022-04-08 09:14:58,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134894531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:14:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155533063] [2022-04-08 09:14:58,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:14:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:14:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:14:58,660 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:14:58,662 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:14:58,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:14:58,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:14:58,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 106 conjunts are in the unsatisfiable core [2022-04-08 09:14:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:14:58,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:15:00,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {4625#true} call ULTIMATE.init(); {4625#true} is VALID [2022-04-08 09:15:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {4625#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(14, 2);call #Ultimate.allocInit(12, 3); {4625#true} is VALID [2022-04-08 09:15:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {4625#true} assume true; {4625#true} is VALID [2022-04-08 09:15:00,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4625#true} {4625#true} #96#return; {4625#true} is VALID [2022-04-08 09:15:00,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {4625#true} call #t~ret6 := main(); {4625#true} is VALID [2022-04-08 09:15:00,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {4625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4630#(= main_~x~0 0)} is VALID [2022-04-08 09:15:00,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {4630#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4630#(= main_~x~0 0)} is VALID [2022-04-08 09:15:00,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {4630#(= main_~x~0 0)} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4660#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4664#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-08 09:15:00,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {4664#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4668#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {4668#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4672#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {4672#(and (= (+ main_~x~0 (- 4)) 4) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4676#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#(and (= main_~x~0 10) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4680#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} is VALID [2022-04-08 09:15:00,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {4680#(and (<= (mod main_~y~0 2) 0) (= 10 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4684#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {4684#(and (= main_~x~0 14) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4688#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {4688#(and (= 14 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4692#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {4692#(and (= main_~x~0 18) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4696#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {4696#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4696#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {4696#(and (= 18 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4703#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 18))} is VALID [2022-04-08 09:15:00,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {4703#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 18))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4707#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {4707#(and (= main_~x~0 24) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4711#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} is VALID [2022-04-08 09:15:00,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {4711#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 24))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4715#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {4715#(and (= main_~x~0 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4719#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {4719#(and (= 28 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4723#(and (= (+ main_~x~0 (- 4)) 28) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {4723#(and (= (+ main_~x~0 (- 4)) 28) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4727#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} is VALID [2022-04-08 09:15:00,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {4727#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4731#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} is VALID [2022-04-08 09:15:00,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {4731#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 36))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4735#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {4735#(and (= 36 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4739#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {4739#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4739#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {4739#(and (= 40 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4746#(and (<= (mod main_~y~0 2) 0) (= 40 (+ (- 2) main_~x~0)))} is VALID [2022-04-08 09:15:00,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {4746#(and (<= (mod main_~y~0 2) 0) (= 40 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4750#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {4750#(and (= 44 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4754#(and (<= (mod main_~y~0 2) 0) (= 44 (+ (- 2) main_~x~0)))} is VALID [2022-04-08 09:15:00,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {4754#(and (<= (mod main_~y~0 2) 0) (= 44 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4758#(and (= 44 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {4758#(and (= 44 (+ main_~x~0 (- 4))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4762#(and (= 44 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#(and (= 44 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4766#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {4766#(and (= main_~x~0 52) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4770#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {4770#(and (= 52 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4774#(and (<= (mod main_~y~0 2) 0) (= 52 (+ main_~x~0 (- 4))))} is VALID [2022-04-08 09:15:00,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {4774#(and (<= (mod main_~y~0 2) 0) (= 52 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4778#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {4778#(and (= main_~x~0 58) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4782#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {4782#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4782#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {4782#(and (= 58 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4789#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} is VALID [2022-04-08 09:15:00,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {4789#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 58))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4793#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} is VALID [2022-04-08 09:15:00,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {4793#(and (<= (mod main_~y~0 2) 0) (= 64 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4797#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} is VALID [2022-04-08 09:15:00,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {4797#(and (<= (mod main_~y~0 2) 0) (= 66 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4801#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {4801#(and (= 66 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4805#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {4805#(and (= main_~x~0 70) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4809#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {4809#(and (= 70 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} is VALID [2022-04-08 09:15:00,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {4813#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 70))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4817#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} is VALID [2022-04-08 09:15:00,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {4817#(and (<= (mod main_~y~0 2) 0) (= 76 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4821#(and (<= (mod main_~y~0 2) 0) (= 76 (+ (- 2) main_~x~0)))} is VALID [2022-04-08 09:15:00,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {4821#(and (<= (mod main_~y~0 2) 0) (= 76 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4825#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {4825#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {4825#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {4825#(and (= main_~x~0 80) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4832#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 80))} is VALID [2022-04-08 09:15:00,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {4832#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4836#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 80))} is VALID [2022-04-08 09:15:00,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {4836#(and (<= (mod main_~y~0 2) 0) (= (+ main_~x~0 (- 4)) 80))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4840#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {4840#(and (= main_~x~0 86) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4844#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {4844#(and (= 88 main_~x~0) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4848#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} is VALID [2022-04-08 09:15:00,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {4848#(and (<= (mod main_~y~0 2) 0) (= 88 (+ (- 2) main_~x~0)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4852#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} is VALID [2022-04-08 09:15:00,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {4852#(and (<= (mod main_~y~0 2) 0) (= 88 (+ main_~x~0 (- 4))))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4856#(and (= 88 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {4856#(and (= 88 (+ main_~x~0 (- 6))) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4860#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {4860#(and (= main_~x~0 96) (<= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4864#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 96))} is VALID [2022-04-08 09:15:00,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {4864#(and (<= (mod main_~y~0 2) 0) (= (+ (- 2) main_~x~0) 96))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4868#(and (= (+ main_~x~0 (- 4)) 96) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {4868#(and (= (+ main_~x~0 (- 4)) 96) (<= (mod main_~y~0 2) 0))} assume !(~x~0 % 4294967296 < 99); {4868#(and (= (+ main_~x~0 (- 4)) 96) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-08 09:15:00,692 INFO L272 TraceCheckUtils]: 62: Hoare triple {4868#(and (= (+ main_~x~0 (- 4)) 96) (<= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:15:00,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {4875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:15:00,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {4879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4626#false} is VALID [2022-04-08 09:15:00,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {4626#false} assume !false; {4626#false} is VALID [2022-04-08 09:15:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:15:00,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:15:02,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {4626#false} assume !false; {4626#false} is VALID [2022-04-08 09:15:02,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {4879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4626#false} is VALID [2022-04-08 09:15:02,015 INFO L290 TraceCheckUtils]: 63: Hoare triple {4875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:15:02,016 INFO L272 TraceCheckUtils]: 62: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:15:02,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume !!(~x~0 % 4294967296 < 99); {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {5060#(forall ((aux_div_main_~y~0_17 Int) (aux_mod_main_~y~0_17 Int)) (or (< (+ main_~x~0 (* (div (+ aux_mod_main_~y~0_17 (* 2 aux_div_main_~y~0_17)) 2) 2) 1) (+ aux_mod_main_~y~0_17 (* 2 aux_div_main_~y~0_17) (* 2 (div (+ main_~x~0 2) 2)))) (< aux_mod_main_~y~0_17 0) (< 0 aux_mod_main_~y~0_17)))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4632#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-08 09:15:02,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {5064#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} assume !!(~x~0 % 4294967296 < 99); {5060#(forall ((aux_div_main_~y~0_17 Int) (aux_mod_main_~y~0_17 Int)) (or (< (+ main_~x~0 (* (div (+ aux_mod_main_~y~0_17 (* 2 aux_div_main_~y~0_17)) 2) 2) 1) (+ aux_mod_main_~y~0_17 (* 2 aux_div_main_~y~0_17) (* 2 (div (+ main_~x~0 2) 2)))) (< aux_mod_main_~y~0_17 0) (< 0 aux_mod_main_~y~0_17)))} is VALID [2022-04-08 09:15:02,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {4625#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5064#(< 0 (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) (div (+ main_~x~0 2) 2) 1))} is VALID [2022-04-08 09:15:02,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {4625#true} call #t~ret6 := main(); {4625#true} is VALID [2022-04-08 09:15:02,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4625#true} {4625#true} #96#return; {4625#true} is VALID [2022-04-08 09:15:02,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {4625#true} assume true; {4625#true} is VALID [2022-04-08 09:15:02,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {4625#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(14, 2);call #Ultimate.allocInit(12, 3); {4625#true} is VALID [2022-04-08 09:15:02,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {4625#true} call ULTIMATE.init(); {4625#true} is VALID [2022-04-08 09:15:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-08 09:15:02,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155533063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:15:02,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:15:02,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 55, 7] total 62 [2022-04-08 09:15:02,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:15:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941611762] [2022-04-08 09:15:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941611762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:15:02,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:15:02,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:15:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142950675] [2022-04-08 09:15:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:15:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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 66 [2022-04-08 09:15:02,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:15:02,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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:15:02,113 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:15:02,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:15:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:15:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:15:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3452, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 09:15:02,115 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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:15:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:02,463 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-08 09:15:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:15:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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 66 [2022-04-08 09:15:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:15:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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:15:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-08 09:15:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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:15:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-08 09:15:02,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-08 09:15:02,497 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:15:02,498 INFO L225 Difference]: With dead ends: 67 [2022-04-08 09:15:02,498 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:15:02,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 29 SyntacticMatches, 99 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=353, Invalid=3937, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 09:15:02,499 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:15:02,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:15:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:15:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:15:02,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:15:02,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:02,500 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:02,500 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:02,500 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:15:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:02,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:02,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:02,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:15:02,501 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:15:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:15:02,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:15:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:02,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:02,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:15:02,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:15:02,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:15:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:15:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:15:02,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2022-04-08 09:15:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:15:02,502 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:15:02,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 6 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:15:02,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:15:02,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:15:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:15:02,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:15:02,504 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:15:02,523 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:15:02,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:15:02,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:15:03,367 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:15:03,367 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:15:03,367 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:15:03,367 INFO L878 garLoopResultBuilder]: At program point L27-1(lines 17 47) the Hoare annotation is: (let ((.cse2 (div main_~y~0 2))) (let ((.cse1 (* .cse2 2))) (or (let ((.cse0 (+ main_~x~0 1))) (and (<= 0 .cse0) (<= .cse0 0) (< .cse1 main_~y~0))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse2) main_~y~0 main_~x~0) 2) 2))) (= .cse1 main_~y~0))))) [2022-04-08 09:15:03,367 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 50) the Hoare annotation is: true [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 17 47) the Hoare annotation is: (let ((.cse1 (div main_~y~0 2))) (let ((.cse0 (* .cse1 2))) (or (and (<= 1 main_~x~0) (<= main_~x~0 1) (< .cse0 main_~y~0)) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse1) main_~y~0 main_~x~0) 2) 2))) (= .cse0 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L24-1(lines 17 47) the Hoare annotation is: (let ((.cse1 (div main_~y~0 2))) (let ((.cse0 (* .cse1 2))) (or (and (<= 1 main_~x~0) (<= main_~x~0 1) (< .cse0 main_~y~0)) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse1) main_~y~0 main_~x~0) 2) 2))) (= .cse0 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L45-1(lines 17 47) the Hoare annotation is: (let ((.cse0 (div main_~y~0 2))) (let ((.cse1 (* .cse0 2))) (or (= main_~x~0 0) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse0) main_~y~0 main_~x~0) 2) 2))) (= .cse1 main_~y~0)) (and (<= (+ (div main_~x~0 4294967296) 1) 0) (<= 0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* 2 (div (+ .cse1 main_~x~0 (* (- 1) main_~y~0)) 2)) 1)) (< .cse1 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L33-1(lines 17 47) the Hoare annotation is: (let ((.cse2 (div main_~y~0 2))) (let ((.cse1 (* .cse2 2))) (or (let ((.cse0 (+ main_~x~0 3))) (and (<= .cse0 0) (<= 0 .cse0) (< .cse1 main_~y~0))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse2) main_~y~0 main_~x~0) 2) 2))) (= .cse1 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L21-1(lines 17 47) the Hoare annotation is: (let ((.cse2 (div main_~y~0 2))) (let ((.cse1 (* .cse2 2))) (or (let ((.cse0 (+ main_~x~0 1))) (and (<= 0 .cse0) (<= .cse0 0) (< .cse1 main_~y~0))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse2) main_~y~0 main_~x~0) 2) 2))) (= .cse1 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L17-2(lines 17 47) the Hoare annotation is: (let ((.cse2 (div main_~y~0 2))) (let ((.cse1 (* .cse2 2))) (let ((.cse0 (<= main_~y~0 .cse1))) (or (and (not .cse0) (<= main_~x~0 (+ (* 2 (div (+ .cse1 main_~x~0 (* (- 1) main_~y~0)) 2)) 1))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse2) main_~y~0 main_~x~0) 2) 2))) .cse0))))) [2022-04-08 09:15:03,368 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 50) the Hoare annotation is: true [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L42-1(lines 17 47) the Hoare annotation is: (let ((.cse2 (div main_~y~0 2))) (let ((.cse1 (* .cse2 2))) (or (let ((.cse0 (+ main_~x~0 1))) (and (<= 0 .cse0) (<= .cse0 0) (< .cse1 main_~y~0))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse2) main_~y~0 main_~x~0) 2) 2))) (= .cse1 main_~y~0))))) [2022-04-08 09:15:03,368 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 50) the Hoare annotation is: true [2022-04-08 09:15:03,368 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 17 47) the Hoare annotation is: (let ((.cse1 (div main_~y~0 2))) (let ((.cse0 (* .cse1 2))) (or (and (<= 1 main_~x~0) (<= main_~x~0 1) (< .cse0 main_~y~0)) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse1) main_~y~0 main_~x~0) 2) 2))) (= .cse0 main_~y~0))))) [2022-04-08 09:15:03,369 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 19) the Hoare annotation is: (or (= main_~x~0 0) (let ((.cse0 (div main_~y~0 2))) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse0) main_~y~0 main_~x~0) 2) 2))) (<= main_~y~0 (* .cse0 2))))) [2022-04-08 09:15:03,369 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 47) the Hoare annotation is: (let ((.cse1 (div main_~y~0 2))) (let ((.cse0 (* .cse1 2))) (or (and (<= main_~x~0 (+ (* 2 (div (+ .cse0 main_~x~0 (* (- 1) main_~y~0)) 2)) 1)) (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)) (< .cse0 main_~y~0)) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse1) main_~y~0 main_~x~0) 2) 2))) (= .cse0 main_~y~0))))) [2022-04-08 09:15:03,369 INFO L878 garLoopResultBuilder]: At program point L39-1(lines 17 47) the Hoare annotation is: (let ((.cse1 (div main_~y~0 2))) (let ((.cse0 (* .cse1 2))) (or (and (<= main_~x~0 3) (<= 3 main_~x~0) (< .cse0 main_~y~0)) (and (<= main_~x~0 (+ 2 (* (div (+ (- 2) (* (- 2) .cse1) main_~y~0 main_~x~0) 2) 2))) (= .cse0 main_~y~0))))) [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2022-04-08 09:15:03,369 INFO L878 garLoopResultBuilder]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:15:03,370 INFO L878 garLoopResultBuilder]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:15:03,370 INFO L885 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2022-04-08 09:15:03,370 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:15:03,372 INFO L719 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2, 2, 2] [2022-04-08 09:15:03,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:15:03,376 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:15:03,379 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:15:03,421 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:15:03,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:15:03 BoogieIcfgContainer [2022-04-08 09:15:03,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:15:03,431 INFO L158 Benchmark]: Toolchain (without parser) took 32721.38ms. Allocated memory was 179.3MB in the beginning and 260.0MB in the end (delta: 80.7MB). Free memory was 129.1MB in the beginning and 134.0MB in the end (delta: -4.9MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-04-08 09:15:03,431 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 179.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:15:03,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.98ms. Allocated memory is still 179.3MB. Free memory was 128.9MB in the beginning and 154.5MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:15:03,431 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 152.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:15:03,431 INFO L158 Benchmark]: RCFGBuilder took 336.20ms. Allocated memory is still 179.3MB. Free memory was 152.8MB in the beginning and 140.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:15:03,432 INFO L158 Benchmark]: TraceAbstraction took 31992.44ms. Allocated memory was 179.3MB in the beginning and 260.0MB in the end (delta: 80.7MB). Free memory was 139.9MB in the beginning and 134.0MB in the end (delta: 5.9MB). Peak memory consumption was 86.9MB. Max. memory is 8.0GB. [2022-04-08 09:15:03,433 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 179.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.98ms. Allocated memory is still 179.3MB. Free memory was 128.9MB in the beginning and 154.5MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 152.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 336.20ms. Allocated memory is still 179.3MB. Free memory was 152.8MB in the beginning and 140.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 31992.44ms. Allocated memory was 179.3MB in the beginning and 260.0MB in the end (delta: 80.7MB). Free memory was 139.9MB in the beginning and 134.0MB in the end (delta: 5.9MB). Peak memory consumption was 86.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4186 IncrementalHoareTripleChecker+Invalid, 4495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 211 mSDtfsCounter, 4186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 352 SyntacticMatches, 113 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9190 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=10, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 8 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 88 PreInvPairs, 180 NumberOfFragments, 580 HoareAnnotationTreeSize, 88 FomulaSimplifications, 568 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 2107 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (x == 0 || (x <= 2 + (-2 + -2 * (y / 2) + y + x) / 2 * 2 && y / 2 * 2 == y)) || (((x / 4294967296 + 1 <= 0 && 0 <= 5 + x) && x <= 2 * ((y / 2 * 2 + x + -1 * y) / 2) + 1) && y / 2 * 2 < y) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:15:03,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...