/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:29,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:29,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:29,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:29,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:29,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:29,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:29,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:29,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:29,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:29,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:29,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:29,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:29,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:29,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:29,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:29,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:29,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:29,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:29,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:29,859 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:29,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:29,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:29,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:29,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:29,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:29,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:29,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:29,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:29,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:29,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:29,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:29,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:29,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:29,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:29,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:29,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:29,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:29,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:29,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:29,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:29,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:29,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:31:29,894 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:29,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:29,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:29,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:29,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:29,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:29,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:29,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:29,896 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:29,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:29,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:29,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:29,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:29,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:29,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:29,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:29,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:29,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:29,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:31:30,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:30,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:30,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:30,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:30,084 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:30,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-27 10:31:30,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0893eb3/c63bae8cc6f34f67bfdeb150afc746a2/FLAG8b8ee19f2 [2022-04-27 10:31:30,473 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:30,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-27 10:31:30,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0893eb3/c63bae8cc6f34f67bfdeb150afc746a2/FLAG8b8ee19f2 [2022-04-27 10:31:30,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0893eb3/c63bae8cc6f34f67bfdeb150afc746a2 [2022-04-27 10:31:30,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:30,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:30,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:30,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:30,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:30,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0b1368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30, skipping insertion in model container [2022-04-27 10:31:30,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:30,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:30,615 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_1-2.c[373,386] [2022-04-27 10:31:30,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:30,646 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:30,656 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_1-2.c[373,386] [2022-04-27 10:31:30,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:30,667 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:30,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30 WrapperNode [2022-04-27 10:31:30,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:30,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:30,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:30,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:30,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:30,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:30,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:30,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:30,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (1/1) ... [2022-04-27 10:31:30,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:30,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:30,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:31:30,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:31:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:30,800 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:30,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:30,873 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:30,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:30,878 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:30,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:30 BoogieIcfgContainer [2022-04-27 10:31:30,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:30,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:30,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:30,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:30,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:30" (1/3) ... [2022-04-27 10:31:30,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b32d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:30, skipping insertion in model container [2022-04-27 10:31:30,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:30" (2/3) ... [2022-04-27 10:31:30,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b32d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:30, skipping insertion in model container [2022-04-27 10:31:30,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:30" (3/3) ... [2022-04-27 10:31:30,885 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2022-04-27 10:31:30,894 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:30,894 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:30,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:30,928 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f039943, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3134273c [2022-04-27 10:31:30,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:31:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:30,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:30,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:30,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-27 10:31:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:30,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37903747] [2022-04-27 10:31:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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); {22#true} is VALID [2022-04-27 10:31:31,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:31:31,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:31:31,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:31,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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); {22#true} is VALID [2022-04-27 10:31:31,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:31:31,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:31:31,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-27 10:31:31,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-27 10:31:31,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-27 10:31:31,147 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#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)); {23#false} is VALID [2022-04-27 10:31:31,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-27 10:31:31,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-27 10:31:31,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-27 10:31:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:31,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37903747] [2022-04-27 10:31:31,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37903747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:31,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:31,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080541234] [2022-04-27 10:31:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:31,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:31,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:31,207 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,294 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-27 10:31:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 10:31:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 10:31:31,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 10:31:31,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,362 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:31:31,363 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:31:31,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:31,368 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:31,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:31:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:31:31,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:31,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,393 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,393 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,399 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:31:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:31,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:31:31,400 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 10:31:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,402 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:31:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:31,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:31,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 10:31:31,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 10:31:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 10:31:31,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:31,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:31,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:31,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:31,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-27 10:31:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:31,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419427286] [2022-04-27 10:31:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(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); {115#true} is VALID [2022-04-27 10:31:31,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:31:31,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:31:31,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} call ULTIMATE.init(); {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:31,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(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); {115#true} is VALID [2022-04-27 10:31:31,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:31:31,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:31:31,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} call #t~ret6 := main(); {115#true} is VALID [2022-04-27 10:31:31,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {120#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {116#false} is VALID [2022-04-27 10:31:31,524 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#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)); {116#false} is VALID [2022-04-27 10:31:31,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} ~cond := #in~cond; {116#false} is VALID [2022-04-27 10:31:31,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} assume 0 == ~cond; {116#false} is VALID [2022-04-27 10:31:31,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-04-27 10:31:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419427286] [2022-04-27 10:31:31,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419427286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:31,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:31,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419246065] [2022-04-27 10:31:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:31,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:31,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:31,536 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,593 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:31:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:31:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:31:31,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 10:31:31,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,622 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:31:31,623 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:31:31,623 INFO L412 NwaCegarLoop]: 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-27 10:31:31,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:31,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:31:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-27 10:31:31,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:31,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,627 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,627 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,628 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 10:31:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 10:31:31,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:31:31,629 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:31:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,629 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 10:31:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 10:31:31,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:31,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:31:31,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 10:31:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:31,631 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:31:31,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:31:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:31:31,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:31,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:31,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:31,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-27 10:31:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:31,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510566065] [2022-04-27 10:31:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(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); {208#true} is VALID [2022-04-27 10:31:31,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:31,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:31,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:31,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(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); {208#true} is VALID [2022-04-27 10:31:31,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:31,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:31,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:31,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= 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; {214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:31,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {209#false} is VALID [2022-04-27 10:31:31,714 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#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)); {209#false} is VALID [2022-04-27 10:31:31,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:31:31,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:31,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510566065] [2022-04-27 10:31:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510566065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:31,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295360934] [2022-04-27 10:31:31,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:31,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:31,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:31:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:31:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:31,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:31:31,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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); {208#true} is VALID [2022-04-27 10:31:31,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:31,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:31,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:31,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= 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; {240#(= main_~x~0 2)} is VALID [2022-04-27 10:31:31,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(= main_~x~0 2)} assume !(~x~0 % 4294967296 < 99); {209#false} is VALID [2022-04-27 10:31:31,829 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#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)); {209#false} is VALID [2022-04-27 10:31:31,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:31:31,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:31,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:31,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:31,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:31,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:31:31,903 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#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)); {209#false} is VALID [2022-04-27 10:31:31,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {209#false} is VALID [2022-04-27 10:31:31,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(< (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; {268#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:31,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {272#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:31,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {272#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:31,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:31,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:31,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:31,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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); {208#true} is VALID [2022-04-27 10:31:31,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:31:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295360934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:31,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:31,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:31:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107526400] [2022-04-27 10:31:31,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:31,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:31:31,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:31,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:31:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:31:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:31:31,925 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:32,115 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 10:31:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:31:32,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:31:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 10:31:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 10:31:32,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 10:31:32,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:32,150 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:31:32,150 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:31:32,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:31:32,151 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:32,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:31:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-27 10:31:32,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:32,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,158 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,158 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:32,159 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 10:31:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 10:31:32,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:32,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:32,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-27 10:31:32,160 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-27 10:31:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:32,161 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 10:31:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 10:31:32,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:32,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:32,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:32,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-27 10:31:32,162 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-04-27 10:31:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:32,162 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-27 10:31:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 10:31:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:31:32,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:32,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:32,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:32,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:32,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1838845100, now seen corresponding path program 2 times [2022-04-27 10:31:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355268993] [2022-04-27 10:31:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#(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); {422#true} is VALID [2022-04-27 10:31:32,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 10:31:32,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #42#return; {422#true} is VALID [2022-04-27 10:31:32,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:32,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#(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); {422#true} is VALID [2022-04-27 10:31:32,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 10:31:32,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #42#return; {422#true} is VALID [2022-04-27 10:31:32,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret6 := main(); {422#true} is VALID [2022-04-27 10:31:32,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {427#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {427#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#(= 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; {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(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; {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(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; {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:32,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:32,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(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; {431#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:32,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {423#false} is VALID [2022-04-27 10:31:32,480 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#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)); {423#false} is VALID [2022-04-27 10:31:32,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2022-04-27 10:31:32,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#false} assume 0 == ~cond; {423#false} is VALID [2022-04-27 10:31:32,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 10:31:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:32,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355268993] [2022-04-27 10:31:32,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355268993] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969665091] [2022-04-27 10:31:32,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:32,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:32,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:32,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:32,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:31:32,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 10:31:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:32,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 10:31:32,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#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); {422#true} is VALID [2022-04-27 10:31:32,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 10:31:32,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #42#return; {422#true} is VALID [2022-04-27 10:31:32,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret6 := main(); {422#true} is VALID [2022-04-27 10:31:32,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {427#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {427#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#(= 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; {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {428#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(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; {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {429#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(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; {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:32,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {430#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:32,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(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; {475#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:32,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {475#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {423#false} is VALID [2022-04-27 10:31:32,777 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#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)); {423#false} is VALID [2022-04-27 10:31:32,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2022-04-27 10:31:32,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#false} assume 0 == ~cond; {423#false} is VALID [2022-04-27 10:31:32,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 10:31:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:32,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:32,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 10:31:32,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#false} assume 0 == ~cond; {423#false} is VALID [2022-04-27 10:31:32,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2022-04-27 10:31:32,905 INFO L272 TraceCheckUtils]: 15: Hoare triple {423#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)); {423#false} is VALID [2022-04-27 10:31:32,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {503#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {423#false} is VALID [2022-04-27 10:31:32,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#(< (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; {503#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:32,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {507#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:32,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {514#(< (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; {507#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:32,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {514#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:32,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {521#(< (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; {514#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:32,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {521#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:32,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(< (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; {521#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:32,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {528#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:32,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {528#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:32,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret6 := main(); {422#true} is VALID [2022-04-27 10:31:32,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #42#return; {422#true} is VALID [2022-04-27 10:31:32,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 10:31:32,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#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); {422#true} is VALID [2022-04-27 10:31:32,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 10:31:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:32,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969665091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:32,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:32,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:31:32,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145611815] [2022-04-27 10:31:32,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:31:32,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:32,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:32,944 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-27 10:31:32,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:31:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:31:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:31:32,945 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,604 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 10:31:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:31:33,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:31:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-27 10:31:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-27 10:31:33,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-27 10:31:33,685 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-27 10:31:33,687 INFO L225 Difference]: With dead ends: 48 [2022-04-27 10:31:33,687 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 10:31:33,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2022-04-27 10:31:33,689 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:33,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:31:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 10:31:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-04-27 10:31:33,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:33,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,706 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,707 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,708 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-27 10:31:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-27 10:31:33,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:33,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:33,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 43 states. [2022-04-27 10:31:33,709 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 43 states. [2022-04-27 10:31:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,710 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-27 10:31:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-27 10:31:33,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:33,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:33,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:33,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 10:31:33,712 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2022-04-27 10:31:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:33,712 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 10:31:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 10:31:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:31:33,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:33,713 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:33,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:33,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:31:33,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1976334073, now seen corresponding path program 1 times [2022-04-27 10:31:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:33,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285026557] [2022-04-27 10:31:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:33,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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); {783#true} is VALID [2022-04-27 10:31:33,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 10:31:33,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #42#return; {783#true} is VALID [2022-04-27 10:31:33,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:33,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(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); {783#true} is VALID [2022-04-27 10:31:33,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 10:31:33,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #42#return; {783#true} is VALID [2022-04-27 10:31:33,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 10:31:33,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-27 10:31:33,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !!(~x~0 % 4294967296 < 99); {783#true} is VALID [2022-04-27 10:31:33,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#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; {788#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 10:31:33,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 99); {788#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(= (+ (* (- 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; {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#false} assume !!(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#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; {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#false} assume !!(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#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; {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#false} assume !!(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#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; {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#false} assume !!(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#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; {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {784#false} assume !!(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#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; {784#false} is VALID [2022-04-27 10:31:33,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#false} assume !(~x~0 % 4294967296 < 99); {784#false} is VALID [2022-04-27 10:31:33,964 INFO L272 TraceCheckUtils]: 21: Hoare triple {784#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)); {784#false} is VALID [2022-04-27 10:31:33,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#false} ~cond := #in~cond; {784#false} is VALID [2022-04-27 10:31:33,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#false} assume 0 == ~cond; {784#false} is VALID [2022-04-27 10:31:33,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 10:31:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:31:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285026557] [2022-04-27 10:31:33,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285026557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:33,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:33,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:33,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541039252] [2022-04-27 10:31:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:33,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:33,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:33,975 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,037 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-27 10:31:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 10:31:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 10:31:34,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-27 10:31:34,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:34,058 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:31:34,058 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 10:31:34,058 INFO L412 NwaCegarLoop]: 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-27 10:31:34,059 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:34,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 10:31:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-27 10:31:34,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:34,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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-27 10:31:34,085 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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-27 10:31:34,085 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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-27 10:31:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,086 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:31:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:31:34,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:34,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:34,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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 46 states. [2022-04-27 10:31:34,087 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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 46 states. [2022-04-27 10:31:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:34,089 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:31:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:31:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:34,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:34,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:34,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 40 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-27 10:31:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-27 10:31:34,090 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 25 [2022-04-27 10:31:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:34,091 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-27 10:31:34,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 10:31:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:31:34,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:34,091 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:31:34,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 942801427, now seen corresponding path program 1 times [2022-04-27 10:31:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508760617] [2022-04-27 10:31:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:34,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(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); {1051#true} is VALID [2022-04-27 10:31:34,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1051#true} assume true; {1051#true} is VALID [2022-04-27 10:31:34,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1051#true} {1051#true} #42#return; {1051#true} is VALID [2022-04-27 10:31:34,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:34,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(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); {1051#true} is VALID [2022-04-27 10:31:34,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2022-04-27 10:31:34,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #42#return; {1051#true} is VALID [2022-04-27 10:31:34,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2022-04-27 10:31:34,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1056#(= main_~x~0 0)} is VALID [2022-04-27 10:31:34,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1056#(= main_~x~0 0)} is VALID [2022-04-27 10:31:34,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#(= 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; {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:34,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:34,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1057#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:34,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:34,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1058#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:34,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:34,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1059#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:34,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:34,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:34,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:34,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:34,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:34,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {1062#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1063#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 10:31:34,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {1063#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 99); {1052#false} is VALID [2022-04-27 10:31:34,235 INFO L272 TraceCheckUtils]: 21: Hoare triple {1052#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)); {1052#false} is VALID [2022-04-27 10:31:34,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#false} ~cond := #in~cond; {1052#false} is VALID [2022-04-27 10:31:34,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1052#false} assume 0 == ~cond; {1052#false} is VALID [2022-04-27 10:31:34,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2022-04-27 10:31:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508760617] [2022-04-27 10:31:34,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508760617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708187404] [2022-04-27 10:31:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:34,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:34,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:31:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:34,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 10:31:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:34,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:34,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2022-04-27 10:31:34,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1051#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); {1051#true} is VALID [2022-04-27 10:31:34,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2022-04-27 10:31:34,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #42#return; {1051#true} is VALID [2022-04-27 10:31:34,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2022-04-27 10:31:34,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1056#(= main_~x~0 0)} is VALID [2022-04-27 10:31:34,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1056#(= main_~x~0 0)} is VALID [2022-04-27 10:31:34,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#(= 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; {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:34,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {1057#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:34,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1057#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:34,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1058#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:34,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1058#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:34,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1059#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:34,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {1059#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:34,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:34,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:34,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:34,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:34,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {1062#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:34,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1062#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1125#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:34,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1052#false} is VALID [2022-04-27 10:31:34,522 INFO L272 TraceCheckUtils]: 21: Hoare triple {1052#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)); {1052#false} is VALID [2022-04-27 10:31:34,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#false} ~cond := #in~cond; {1052#false} is VALID [2022-04-27 10:31:34,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {1052#false} assume 0 == ~cond; {1052#false} is VALID [2022-04-27 10:31:34,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2022-04-27 10:31:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:34,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:34,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#false} assume !false; {1052#false} is VALID [2022-04-27 10:31:34,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {1052#false} assume 0 == ~cond; {1052#false} is VALID [2022-04-27 10:31:34,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {1052#false} ~cond := #in~cond; {1052#false} is VALID [2022-04-27 10:31:34,703 INFO L272 TraceCheckUtils]: 21: Hoare triple {1052#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)); {1052#false} is VALID [2022-04-27 10:31:34,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {1052#false} is VALID [2022-04-27 10:31:34,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {1157#(< (mod (+ main_~x~0 1) 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; {1153#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:34,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1157#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1157#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:34,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {1164#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1157#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:34,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1164#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1164#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:34,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {1171#(< (mod (+ main_~x~0 3) 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; {1164#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:34,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {1171#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1171#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:31:34,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1171#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:31:34,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1178#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:34,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {1185#(< (mod (+ 5 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; {1178#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:34,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {1185#(< (mod (+ 5 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1185#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:34,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1192#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1185#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:34,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1192#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:34,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {1199#(< (mod (+ 7 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; {1192#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:34,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {1199#(< (mod (+ 7 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1199#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:34,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1199#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:34,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#true} call #t~ret6 := main(); {1051#true} is VALID [2022-04-27 10:31:34,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#true} {1051#true} #42#return; {1051#true} is VALID [2022-04-27 10:31:34,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#true} assume true; {1051#true} is VALID [2022-04-27 10:31:34,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1051#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); {1051#true} is VALID [2022-04-27 10:31:34,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {1051#true} call ULTIMATE.init(); {1051#true} is VALID [2022-04-27 10:31:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:34,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708187404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:34,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:34,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-27 10:31:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364539348] [2022-04-27 10:31:34,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:34,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:34,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:34,742 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-27 10:31:34,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:31:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:31:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:31:34,742 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:36,003 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2022-04-27 10:31:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 10:31:36,003 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:31:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-27 10:31:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-27 10:31:36,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-27 10:31:36,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:36,090 INFO L225 Difference]: With dead ends: 125 [2022-04-27 10:31:36,090 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 10:31:36,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=887, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 10:31:36,091 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:36,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 58 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:31:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 10:31:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 63. [2022-04-27 10:31:36,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:36,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,144 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,144 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:36,147 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-04-27 10:31:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-04-27 10:31:36,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:36,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:36,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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 120 states. [2022-04-27 10:31:36,148 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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 120 states. [2022-04-27 10:31:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:36,150 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-04-27 10:31:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-04-27 10:31:36,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:36,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:36,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:36,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-04-27 10:31:36,153 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 25 [2022-04-27 10:31:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:36,153 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-04-27 10:31:36,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-27 10:31:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:31:36,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:36,153 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:36,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:36,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1350577782, now seen corresponding path program 3 times [2022-04-27 10:31:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:36,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329455603] [2022-04-27 10:31:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:36,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {1799#(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); {1783#true} is VALID [2022-04-27 10:31:36,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:31:36,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1783#true} {1783#true} #42#return; {1783#true} is VALID [2022-04-27 10:31:36,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:36,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1799#(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); {1783#true} is VALID [2022-04-27 10:31:36,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:31:36,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #42#return; {1783#true} is VALID [2022-04-27 10:31:36,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret6 := main(); {1783#true} is VALID [2022-04-27 10:31:36,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:31:36,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1788#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:31:36,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(= 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; {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:36,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:36,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(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; {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:36,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:36,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(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; {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:36,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:36,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1791#(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; {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:36,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:36,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#(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; {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:36,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:36,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#(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; {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:36,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:36,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(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; {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:36,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:36,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {1795#(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; {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:36,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:36,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(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; {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:31:36,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:31:36,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#(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; {1798#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:36,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {1798#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {1784#false} is VALID [2022-04-27 10:31:36,578 INFO L272 TraceCheckUtils]: 27: Hoare triple {1784#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)); {1784#false} is VALID [2022-04-27 10:31:36,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:31:36,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:31:36,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:31:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:36,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329455603] [2022-04-27 10:31:36,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329455603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:36,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713160679] [2022-04-27 10:31:36,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:36,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:36,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:31:36,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:31:36,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:36,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 10:31:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:36,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:36,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2022-04-27 10:31:36,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1783#true} is VALID [2022-04-27 10:31:36,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:31:36,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #42#return; {1783#true} is VALID [2022-04-27 10:31:36,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret6 := main(); {1783#true} is VALID [2022-04-27 10:31:36,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:31:36,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {1788#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1788#(= main_~x~0 0)} is VALID [2022-04-27 10:31:36,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(= 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; {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:36,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1789#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:36,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(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; {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:36,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:36,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(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; {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:36,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {1791#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:36,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {1791#(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; {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:36,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1792#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:36,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#(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; {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:36,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1793#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:36,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#(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; {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:36,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1794#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:36,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(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; {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:36,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {1795#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:36,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {1795#(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; {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:36,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:36,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(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; {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:31:36,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1797#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:31:36,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {1797#(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; {1878#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:31:36,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {1878#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1784#false} is VALID [2022-04-27 10:31:36,915 INFO L272 TraceCheckUtils]: 27: Hoare triple {1784#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)); {1784#false} is VALID [2022-04-27 10:31:36,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:31:36,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:31:36,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:31:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:36,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:37,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2022-04-27 10:31:37,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2022-04-27 10:31:37,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2022-04-27 10:31:37,216 INFO L272 TraceCheckUtils]: 27: Hoare triple {1784#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)); {1784#false} is VALID [2022-04-27 10:31:37,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {1906#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {1784#false} is VALID [2022-04-27 10:31:37,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#(< (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; {1906#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:37,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {1910#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1910#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:37,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {1917#(< (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; {1910#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:37,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {1917#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1917#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:37,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(< (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; {1917#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:37,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {1924#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1924#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:37,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1931#(< (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; {1924#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:37,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1931#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1931#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:37,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#(< (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; {1931#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:37,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {1938#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1938#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:31:37,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {1945#(< (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; {1938#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:31:37,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {1945#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1945#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:31:37,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#(< (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; {1945#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:31:37,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1952#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:31:37,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {1959#(< (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; {1952#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:31:37,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {1959#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1959#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:31:37,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(< (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; {1959#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:31:37,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1966#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:31:37,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(< (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; {1966#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:31:37,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1973#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {1973#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:31:37,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1973#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:31:37,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1783#true} call #t~ret6 := main(); {1783#true} is VALID [2022-04-27 10:31:37,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1783#true} {1783#true} #42#return; {1783#true} is VALID [2022-04-27 10:31:37,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#true} assume true; {1783#true} is VALID [2022-04-27 10:31:37,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1783#true} is VALID [2022-04-27 10:31:37,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2022-04-27 10:31:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:37,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713160679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:37,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:37,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:31:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722035844] [2022-04-27 10:31:37,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:37,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:31:37,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:37,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:37,267 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-27 10:31:37,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:31:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:31:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:31:37,268 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:41,339 INFO L93 Difference]: Finished difference Result 207 states and 253 transitions. [2022-04-27 10:31:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 10:31:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:31:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 97 transitions. [2022-04-27 10:31:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 97 transitions. [2022-04-27 10:31:41,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 97 transitions. [2022-04-27 10:31:41,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:41,513 INFO L225 Difference]: With dead ends: 207 [2022-04-27 10:31:41,513 INFO L226 Difference]: Without dead ends: 202 [2022-04-27 10:31:41,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=680, Invalid=1672, Unknown=0, NotChecked=0, Total=2352 [2022-04-27 10:31:41,515 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:41,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 68 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:31:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-27 10:31:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 87. [2022-04-27 10:31:41,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:41,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,618 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,618 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:41,622 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2022-04-27 10:31:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-04-27 10:31:41,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:41,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:41,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 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 202 states. [2022-04-27 10:31:41,623 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 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 202 states. [2022-04-27 10:31:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:41,627 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2022-04-27 10:31:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-04-27 10:31:41,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:41,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:41,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:41,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-04-27 10:31:41,629 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 31 [2022-04-27 10:31:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:41,629 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-04-27 10:31:41,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-04-27 10:31:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:31:41,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:41,630 INFO L195 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:41,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 10:31:41,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:41,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1438159625, now seen corresponding path program 2 times [2022-04-27 10:31:41,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:41,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073666935] [2022-04-27 10:31:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:41,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:41,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {2901#(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); {2895#true} is VALID [2022-04-27 10:31:41,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-27 10:31:41,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2895#true} {2895#true} #42#return; {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {2895#true} call ULTIMATE.init(); {2901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:41,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {2901#(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); {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {2895#true} assume true; {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2895#true} {2895#true} #42#return; {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {2895#true} call #t~ret6 := main(); {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {2895#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {2895#true} assume !!(~x~0 % 4294967296 < 99); {2895#true} is VALID [2022-04-27 10:31:41,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {2895#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; {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 10:31:41,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume !!(~x~0 % 4294967296 < 99); {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 10:31:41,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#(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; {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 10:31:41,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume !!(~x~0 % 4294967296 < 99); {2900#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {2896#false} assume !!(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {2896#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; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {2896#false} assume !(~x~0 % 4294967296 < 99); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L272 TraceCheckUtils]: 37: Hoare triple {2896#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)); {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {2896#false} ~cond := #in~cond; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {2896#false} assume 0 == ~cond; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {2896#false} assume !false; {2896#false} is VALID [2022-04-27 10:31:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-04-27 10:31:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073666935] [2022-04-27 10:31:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073666935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762610465] [2022-04-27 10:31:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 41 [2022-04-27 10:31:41,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:41,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:41,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:41,893 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,022 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2022-04-27 10:31:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 41 [2022-04-27 10:31:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:42,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 10:31:42,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:42,044 INFO L225 Difference]: With dead ends: 120 [2022-04-27 10:31:42,044 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 10:31:42,044 INFO L412 NwaCegarLoop]: 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-27 10:31:42,045 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:42,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 10:31:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-04-27 10:31:42,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:42,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,153 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,153 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,155 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-04-27 10:31:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-04-27 10:31:42,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:42,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:42,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 10:31:42,155 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 10:31:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,157 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-04-27 10:31:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2022-04-27 10:31:42,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:42,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:42,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:42,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-27 10:31:42,158 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 41 [2022-04-27 10:31:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:42,159 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-27 10:31:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-27 10:31:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:31:42,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:42,160 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:31:42,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 293418680, now seen corresponding path program 2 times [2022-04-27 10:31:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732137238] [2022-04-27 10:31:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:42,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {3419#(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); {3397#true} is VALID [2022-04-27 10:31:42,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-27 10:31:42,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3397#true} {3397#true} #42#return; {3397#true} is VALID [2022-04-27 10:31:42,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:42,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {3419#(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); {3397#true} is VALID [2022-04-27 10:31:42,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-27 10:31:42,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #42#return; {3397#true} is VALID [2022-04-27 10:31:42,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret6 := main(); {3397#true} is VALID [2022-04-27 10:31:42,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3402#(= main_~x~0 0)} is VALID [2022-04-27 10:31:42,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {3402#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3402#(= main_~x~0 0)} is VALID [2022-04-27 10:31:42,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {3402#(= 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; {3403#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:42,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {3403#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {3403#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:42,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {3403#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3404#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:42,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {3404#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3404#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:42,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3404#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3405#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:42,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {3405#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3405#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:42,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {3405#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3406#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:42,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {3406#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3406#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:42,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {3406#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3407#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:42,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {3407#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3407#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:42,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {3407#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {3408#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:42,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {3408#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {3408#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:42,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {3408#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3409#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:42,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {3409#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3409#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:42,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {3409#(and (<= main_~x~0 7) (<= 7 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3410#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:42,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {3410#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3410#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:42,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {3410#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3411#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:42,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {3411#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3411#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:42,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {3411#(and (<= main_~x~0 9) (<= 9 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:42,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {3412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:42,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {3412#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3413#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:42,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {3413#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3413#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:42,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {3413#(and (<= main_~x~0 11) (<= 11 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:42,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:42,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {3414#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3415#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:42,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {3415#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3415#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:42,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {3415#(and (<= main_~x~0 13) (<= 13 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3416#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:42,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {3416#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {3416#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:42,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {3416#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3417#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:42,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {3417#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {3417#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:42,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {3417#(and (<= 15 main_~x~0) (<= main_~x~0 15))} 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; {3418#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:42,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {3418#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {3398#false} is VALID [2022-04-27 10:31:42,474 INFO L272 TraceCheckUtils]: 39: Hoare triple {3398#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)); {3398#false} is VALID [2022-04-27 10:31:42,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-27 10:31:42,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2022-04-27 10:31:42,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-27 10:31:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:42,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732137238] [2022-04-27 10:31:42,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732137238] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:42,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378886369] [2022-04-27 10:31:42,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:42,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:42,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:42,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:42,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:31:42,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:42,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:42,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 10:31:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:42,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:43,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-27 10:31:43,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-27 10:31:43,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-27 10:31:43,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #42#return; {3397#true} is VALID [2022-04-27 10:31:43,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret6 := main(); {3397#true} is VALID [2022-04-27 10:31:43,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3402#(= main_~x~0 0)} is VALID [2022-04-27 10:31:43,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {3402#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {3402#(= main_~x~0 0)} is VALID [2022-04-27 10:31:43,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {3402#(= 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; {3444#(and (= (+ (- 1) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {3444#(and (= (+ (- 1) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3444#(and (= (+ (- 1) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {3444#(and (= (+ (- 1) 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3451#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {3451#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3451#(and (= (+ (- 2) main_~x~0) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3458#(and (= (+ main_~x~0 (- 3)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(and (= (+ main_~x~0 (- 3)) 0) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3458#(and (= (+ main_~x~0 (- 3)) 0) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {3458#(and (= (+ main_~x~0 (- 3)) 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3465#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-27 10:31:43,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {3465#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3465#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 4))} is VALID [2022-04-27 10:31:43,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {3465#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3472#(and (= (+ (- 1) main_~x~0) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#(and (= (+ (- 1) main_~x~0) 4) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3472#(and (= (+ (- 1) main_~x~0) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#(and (= (+ (- 1) 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3479#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {3479#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3479#(and (= 4 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {3479#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3486#(and (= (+ main_~x~0 (- 3)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {3486#(and (= (+ main_~x~0 (- 3)) 4) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3486#(and (= (+ main_~x~0 (- 3)) 4) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {3486#(and (= (+ main_~x~0 (- 3)) 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3493#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-27 10:31:43,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {3493#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3493#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} is VALID [2022-04-27 10:31:43,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {3493#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 8))} 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; {3500#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 8))} is VALID [2022-04-27 10:31:43,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {3500#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 8))} assume !!(~x~0 % 4294967296 < 99); {3500#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 8))} is VALID [2022-04-27 10:31:43,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {3500#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 8))} 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; {3507#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {3507#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3507#(and (= 8 (+ (- 2) main_~x~0)) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {3507#(and (= 8 (+ (- 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3514#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 11))} is VALID [2022-04-27 10:31:43,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {3514#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {3514#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 11))} is VALID [2022-04-27 10:31:43,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {3514#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 11))} 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; {3521#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {3521#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3521#(and (= main_~x~0 12) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {3521#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3528#(and (= main_~x~0 13) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {3528#(and (= main_~x~0 13) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3528#(and (= main_~x~0 13) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {3528#(and (= main_~x~0 13) (<= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3535#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 13))} is VALID [2022-04-27 10:31:43,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {3535#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 13))} assume !!(~x~0 % 4294967296 < 99); {3535#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 13))} is VALID [2022-04-27 10:31:43,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {3535#(and (<= (mod main_~y~0 2) 0) (= (+ (- 1) main_~x~0) 13))} 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; {3542#(and (= main_~x~0 15) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {3542#(and (= main_~x~0 15) (<= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {3542#(and (= main_~x~0 15) (<= (mod main_~y~0 2) 0))} is VALID [2022-04-27 10:31:43,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {3542#(and (= main_~x~0 15) (<= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3549#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-27 10:31:43,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {3549#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} assume !(~x~0 % 4294967296 < 99); {3549#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} is VALID [2022-04-27 10:31:43,225 INFO L272 TraceCheckUtils]: 39: Hoare triple {3549#(and (<= (mod main_~y~0 2) 0) (= main_~x~0 16))} 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)); {3556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:43,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {3556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:43,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {3560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3398#false} is VALID [2022-04-27 10:31:43,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-27 10:31:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:43,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:43,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-27 10:31:43,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {3560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3398#false} is VALID [2022-04-27 10:31:43,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {3556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:43,689 INFO L272 TraceCheckUtils]: 39: Hoare triple {3576#(= (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)); {3556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:43,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {3576#(= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !!(~x~0 % 4294967296 < 99); {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {3583#(= (mod main_~y~0 2) (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; {3576#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:43,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {3674#(<= (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3583#(= (mod main_~y~0 2) (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:43,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {3674#(<= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {3674#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:43,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {3674#(<= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:43,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret6 := main(); {3397#true} is VALID [2022-04-27 10:31:43,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #42#return; {3397#true} is VALID [2022-04-27 10:31:43,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-27 10:31:43,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-27 10:31:43,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-27 10:31:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-27 10:31:43,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378886369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:43,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:43,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 7] total 41 [2022-04-27 10:31:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550138357] [2022-04-27 10:31:43,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:43,709 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:31:43,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:43,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:43,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:43,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-27 10:31:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-27 10:31:43,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 10:31:43,775 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:46,524 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-27 10:31:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 10:31:46,524 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:31:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 79 transitions. [2022-04-27 10:31:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 79 transitions. [2022-04-27 10:31:46,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 79 transitions. [2022-04-27 10:31:46,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:46,608 INFO L225 Difference]: With dead ends: 101 [2022-04-27 10:31:46,608 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 10:31:46,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=4568, Unknown=0, NotChecked=0, Total=4970 [2022-04-27 10:31:46,610 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:46,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 129 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 10:31:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 10:31:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-27 10:31:46,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:46,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,713 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,713 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:46,715 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 10:31:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 10:31:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:46,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:46,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 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 93 states. [2022-04-27 10:31:46,715 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 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 93 states. [2022-04-27 10:31:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:46,717 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 10:31:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 10:31:46,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:46,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:46,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:46,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-04-27 10:31:46,719 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 43 [2022-04-27 10:31:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:46,719 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-04-27 10:31:46,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 39 states have internal predecessors, (82), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-27 10:31:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 10:31:46,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:46,719 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:46,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:46,935 WARN L477 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-27 10:31:46,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash -450523851, now seen corresponding path program 3 times [2022-04-27 10:31:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:46,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835811620] [2022-04-27 10:31:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:47,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {4255#(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); {4232#true} is VALID [2022-04-27 10:31:47,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {4232#true} assume true; {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4232#true} {4232#true} #42#return; {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {4232#true} call ULTIMATE.init(); {4255#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:47,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {4255#(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); {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {4232#true} assume true; {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4232#true} {4232#true} #42#return; {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {4232#true} call #t~ret6 := main(); {4232#true} is VALID [2022-04-27 10:31:47,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {4232#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4237#(= main_~x~0 0)} is VALID [2022-04-27 10:31:47,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {4237#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4237#(= main_~x~0 0)} is VALID [2022-04-27 10:31:47,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(= 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; {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:47,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:47,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {4238#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:47,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:47,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {4239#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:47,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:47,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:47,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:47,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:47,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:47,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:47,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:47,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {4243#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:47,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:47,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {4244#(and (<= main_~x~0 7) (<= 7 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:47,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:47,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:47,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:47,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(and (<= main_~x~0 9) (<= 9 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:47,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:47,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {4247#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:47,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:47,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {4248#(and (<= main_~x~0 11) (<= 11 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:47,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:47,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {4249#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:47,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:47,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {4250#(and (<= main_~x~0 13) (<= 13 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:47,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:47,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {4251#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:47,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:47,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} 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; {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:47,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:47,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {4253#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4254#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 10:31:47,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {4254#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 99); {4233#false} is VALID [2022-04-27 10:31:47,231 INFO L272 TraceCheckUtils]: 41: Hoare triple {4233#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)); {4233#false} is VALID [2022-04-27 10:31:47,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {4233#false} ~cond := #in~cond; {4233#false} is VALID [2022-04-27 10:31:47,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {4233#false} assume 0 == ~cond; {4233#false} is VALID [2022-04-27 10:31:47,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {4233#false} assume !false; {4233#false} is VALID [2022-04-27 10:31:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835811620] [2022-04-27 10:31:47,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835811620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636825529] [2022-04-27 10:31:47,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:47,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 10:31:47,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-04-27 10:31:47,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:47,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 10:31:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:47,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:47,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {4232#true} call ULTIMATE.init(); {4232#true} is VALID [2022-04-27 10:31:47,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {4232#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); {4232#true} is VALID [2022-04-27 10:31:47,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {4232#true} assume true; {4232#true} is VALID [2022-04-27 10:31:47,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4232#true} {4232#true} #42#return; {4232#true} is VALID [2022-04-27 10:31:47,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {4232#true} call #t~ret6 := main(); {4232#true} is VALID [2022-04-27 10:31:47,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {4232#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4237#(= main_~x~0 0)} is VALID [2022-04-27 10:31:47,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {4237#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {4237#(= main_~x~0 0)} is VALID [2022-04-27 10:31:47,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(= 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; {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:47,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {4238#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:47,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {4238#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:47,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4239#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:47,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {4239#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:47,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4240#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:47,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:47,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4241#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:47,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {4241#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:47,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:47,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {4242#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:47,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {4243#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:47,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {4243#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:47,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4244#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:31:47,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {4244#(and (<= main_~x~0 7) (<= 7 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:47,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4245#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:31:47,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:47,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4246#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:31:47,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(and (<= main_~x~0 9) (<= 9 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:47,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4247#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:31:47,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {4247#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:47,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4248#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:31:47,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {4248#(and (<= main_~x~0 11) (<= 11 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:47,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4249#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:31:47,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {4249#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:47,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4250#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:31:47,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {4250#(and (<= main_~x~0 13) (<= 13 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:47,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {4251#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:31:47,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {4251#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:47,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:31:47,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {4252#(and (<= 15 main_~x~0) (<= main_~x~0 15))} 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; {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:47,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4253#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:31:47,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {4253#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4376#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 10:31:47,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {4376#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 99); {4233#false} is VALID [2022-04-27 10:31:47,757 INFO L272 TraceCheckUtils]: 41: Hoare triple {4233#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)); {4233#false} is VALID [2022-04-27 10:31:47,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {4233#false} ~cond := #in~cond; {4233#false} is VALID [2022-04-27 10:31:47,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {4233#false} assume 0 == ~cond; {4233#false} is VALID [2022-04-27 10:31:47,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {4233#false} assume !false; {4233#false} is VALID [2022-04-27 10:31:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:47,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:48,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {4233#false} assume !false; {4233#false} is VALID [2022-04-27 10:31:48,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {4233#false} assume 0 == ~cond; {4233#false} is VALID [2022-04-27 10:31:48,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {4233#false} ~cond := #in~cond; {4233#false} is VALID [2022-04-27 10:31:48,368 INFO L272 TraceCheckUtils]: 41: Hoare triple {4233#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)); {4233#false} is VALID [2022-04-27 10:31:48,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {4404#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {4233#false} is VALID [2022-04-27 10:31:48,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {4408#(< (mod (+ main_~x~0 1) 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; {4404#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:48,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {4408#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4408#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:48,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {4415#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4408#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:48,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {4415#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4415#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:48,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {4422#(< (mod (+ main_~x~0 3) 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; {4415#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:48,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {4422#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4422#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:31:48,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {4429#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4422#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:31:48,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {4429#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4429#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:48,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {4436#(< (mod (+ 5 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; {4429#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:31:48,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {4436#(< (mod (+ 5 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4436#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:48,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {4443#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4436#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:48,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {4443#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4443#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:48,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {4450#(< (mod (+ 7 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; {4443#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:31:48,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {4450#(< (mod (+ 7 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4450#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:48,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {4457#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4450#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:31:48,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {4457#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4457#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:48,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {4464#(< (mod (+ main_~x~0 9) 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; {4457#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:31:48,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {4464#(< (mod (+ main_~x~0 9) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4464#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-27 10:31:48,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {4471#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4464#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-27 10:31:48,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4471#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:31:48,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {4478#(< (mod (+ main_~x~0 11) 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; {4471#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:31:48,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {4478#(< (mod (+ main_~x~0 11) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4478#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-27 10:31:48,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4478#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-27 10:31:48,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4485#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:31:48,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {4492#(< (mod (+ main_~x~0 13) 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; {4485#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:31:48,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {4492#(< (mod (+ main_~x~0 13) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4492#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-27 10:31:48,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {4499#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4492#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-27 10:31:48,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {4499#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4499#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:31:48,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {4506#(< (mod (+ main_~x~0 15) 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; {4499#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:31:48,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {4506#(< (mod (+ main_~x~0 15) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4506#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-27 10:31:48,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4506#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-27 10:31:48,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4513#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:31:48,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4520#(< (mod (+ main_~x~0 17) 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; {4513#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:31:48,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {4520#(< (mod (+ main_~x~0 17) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {4520#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-27 10:31:48,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {4232#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {4520#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-27 10:31:48,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {4232#true} call #t~ret6 := main(); {4232#true} is VALID [2022-04-27 10:31:48,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4232#true} {4232#true} #42#return; {4232#true} is VALID [2022-04-27 10:31:48,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {4232#true} assume true; {4232#true} is VALID [2022-04-27 10:31:48,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {4232#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); {4232#true} is VALID [2022-04-27 10:31:48,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {4232#true} call ULTIMATE.init(); {4232#true} is VALID [2022-04-27 10:31:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:48,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636825529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:48,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:48,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-27 10:31:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140497401] [2022-04-27 10:31:48,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:48,384 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-27 10:31:48,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:48,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:48,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 10:31:48,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 10:31:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 10:31:48,443 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:13,760 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-04-27 10:32:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 10:32:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-27 10:32:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:32:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 117 transitions. [2022-04-27 10:32:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 117 transitions. [2022-04-27 10:32:13,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 117 transitions. [2022-04-27 10:32:13,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:32:13,961 INFO L225 Difference]: With dead ends: 134 [2022-04-27 10:32:13,961 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 10:32:13,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=1552, Invalid=4147, Unknown=1, NotChecked=0, Total=5700 [2022-04-27 10:32:13,963 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:32:13,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 10:32:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 10:32:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-27 10:32:14,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:32:14,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:14,105 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:14,105 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:14,107 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-04-27 10:32:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-27 10:32:14,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:32:14,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:32:14,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 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 129 states. [2022-04-27 10:32:14,107 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 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 129 states. [2022-04-27 10:32:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:32:14,109 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-04-27 10:32:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-27 10:32:14,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:32:14,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:32:14,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:32:14,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:32:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2022-04-27 10:32:14,111 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 45 [2022-04-27 10:32:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:32:14,111 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2022-04-27 10:32:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2022-04-27 10:32:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 10:32:14,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:32:14,111 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:32:14,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 10:32:14,319 WARN L477 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-27 10:32:14,319 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:32:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:32:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2121974854, now seen corresponding path program 4 times [2022-04-27 10:32:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:32:14,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490761933] [2022-04-27 10:32:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:32:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:32:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:32:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:14,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(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); {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#true} assume true; {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5271#true} {5271#true} #42#return; {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {5271#true} call ULTIMATE.init(); {5299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:32:14,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#(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); {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume true; {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5271#true} {5271#true} #42#return; {5271#true} is VALID [2022-04-27 10:32:14,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {5271#true} call #t~ret6 := main(); {5271#true} is VALID [2022-04-27 10:32:14,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5276#(= main_~x~0 0)} is VALID [2022-04-27 10:32:14,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5276#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5276#(= main_~x~0 0)} is VALID [2022-04-27 10:32:14,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {5276#(= 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; {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:14,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:14,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {5277#(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; {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:14,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:14,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {5278#(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; {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:14,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:14,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {5279#(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; {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:14,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:14,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {5280#(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; {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:14,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:14,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {5281#(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; {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:14,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:14,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {5282#(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; {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:14,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:14,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {5283#(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; {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:14,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:14,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#(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; {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:14,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:14,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {5285#(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; {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:14,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:14,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {5286#(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; {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:14,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:14,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {5287#(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; {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:14,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:14,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {5288#(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; {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:14,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:14,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {5289#(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; {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:14,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:14,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#(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; {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:32:14,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:32:14,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {5291#(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; {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:32:14,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:32:14,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {5292#(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; {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:32:14,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:32:14,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {5293#(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; {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:32:14,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:32:14,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {5294#(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; {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:32:14,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:32:14,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {5295#(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; {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:32:14,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:32:14,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {5296#(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; {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:32:14,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:32:14,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {5297#(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; {5298#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} is VALID [2022-04-27 10:32:14,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {5298#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 99); {5272#false} is VALID [2022-04-27 10:32:14,768 INFO L272 TraceCheckUtils]: 51: Hoare triple {5272#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)); {5272#false} is VALID [2022-04-27 10:32:14,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {5272#false} ~cond := #in~cond; {5272#false} is VALID [2022-04-27 10:32:14,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {5272#false} assume 0 == ~cond; {5272#false} is VALID [2022-04-27 10:32:14,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-04-27 10:32:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:32:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:32:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490761933] [2022-04-27 10:32:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490761933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:32:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417574440] [2022-04-27 10:32:14,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:32:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:32:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:32:14,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:32:14,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 10:32:14,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:32:14,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:32:14,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 10:32:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:32:14,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:32:15,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {5271#true} call ULTIMATE.init(); {5271#true} is VALID [2022-04-27 10:32:15,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#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); {5271#true} is VALID [2022-04-27 10:32:15,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume true; {5271#true} is VALID [2022-04-27 10:32:15,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5271#true} {5271#true} #42#return; {5271#true} is VALID [2022-04-27 10:32:15,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {5271#true} call #t~ret6 := main(); {5271#true} is VALID [2022-04-27 10:32:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5276#(= main_~x~0 0)} is VALID [2022-04-27 10:32:15,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {5276#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {5276#(= main_~x~0 0)} is VALID [2022-04-27 10:32:15,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {5276#(= 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; {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:15,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:32:15,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {5277#(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; {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:15,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5278#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:32:15,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {5278#(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; {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:15,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {5279#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:32:15,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {5279#(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; {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:15,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:32:15,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {5280#(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; {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:15,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5281#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:32:15,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {5281#(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; {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:15,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5282#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:32:15,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {5282#(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; {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:15,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {5283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:32:15,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {5283#(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; {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:15,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5284#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:32:15,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {5284#(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; {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:15,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5285#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:32:15,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {5285#(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; {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:15,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:32:15,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {5286#(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; {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:15,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {5287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:32:15,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {5287#(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; {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:15,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5288#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:32:15,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {5288#(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; {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:15,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5289#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:32:15,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {5289#(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; {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:15,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {5290#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:32:15,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#(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; {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:32:15,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5291#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:32:15,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {5291#(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; {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:32:15,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5292#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:32:15,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {5292#(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; {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:32:15,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5293#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:32:15,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {5293#(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; {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:32:15,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5294#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:32:15,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {5294#(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; {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:32:15,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5295#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:32:15,326 INFO L290 TraceCheckUtils]: 45: Hoare triple {5295#(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; {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:32:15,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5296#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:32:15,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {5296#(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; {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:32:15,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5297#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:32:15,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {5297#(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; {5450#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:32:15,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {5450#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 99); {5272#false} is VALID [2022-04-27 10:32:15,328 INFO L272 TraceCheckUtils]: 51: Hoare triple {5272#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)); {5272#false} is VALID [2022-04-27 10:32:15,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {5272#false} ~cond := #in~cond; {5272#false} is VALID [2022-04-27 10:32:15,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {5272#false} assume 0 == ~cond; {5272#false} is VALID [2022-04-27 10:32:15,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-04-27 10:32:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:32:15,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:32:16,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-04-27 10:32:16,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {5272#false} assume 0 == ~cond; {5272#false} is VALID [2022-04-27 10:32:16,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {5272#false} ~cond := #in~cond; {5272#false} is VALID [2022-04-27 10:32:16,309 INFO L272 TraceCheckUtils]: 51: Hoare triple {5272#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)); {5272#false} is VALID [2022-04-27 10:32:16,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {5478#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {5272#false} is VALID [2022-04-27 10:32:16,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {5482#(< (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; {5478#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:32:16,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {5482#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5482#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:32:16,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {5489#(< (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; {5482#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:32:16,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {5489#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5489#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:32:16,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {5496#(< (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; {5489#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:32:16,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {5496#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5496#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:32:16,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {5503#(< (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; {5496#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:32:16,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {5503#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5503#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:32:16,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {5510#(< (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; {5503#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:32:16,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {5510#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5510#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:32:16,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {5517#(< (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; {5510#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:32:16,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {5517#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5517#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:32:16,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {5524#(< (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; {5517#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:32:16,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {5524#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5524#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:32:16,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {5531#(< (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; {5524#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:32:16,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {5531#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5531#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:32:16,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {5538#(< (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; {5531#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:32:16,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {5538#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5538#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:32:16,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {5545#(< (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; {5538#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:32:16,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {5545#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5545#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:32:16,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {5552#(< (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; {5545#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:32:16,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {5552#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5552#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:32:16,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {5559#(< (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; {5552#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:32:16,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {5559#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5559#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:32:16,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {5566#(< (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; {5559#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:32:16,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {5566#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5566#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:32:16,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {5573#(< (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; {5566#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:32:16,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {5573#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5573#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:32:16,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {5580#(< (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; {5573#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:32:16,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {5580#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5580#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#(< (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; {5580#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {5587#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5587#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#(< (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; {5587#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5594#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:32:16,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {5601#(< (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; {5594#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:32:16,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {5601#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5601#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:32:16,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {5608#(< (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; {5601#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:32:16,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {5608#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5608#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-27 10:32:16,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {5615#(< (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; {5608#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-27 10:32:16,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {5615#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5615#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {5622#(< (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; {5615#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {5622#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5622#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {5629#(< (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; {5622#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {5629#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {5629#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {5271#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {5629#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:32:16,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {5271#true} call #t~ret6 := main(); {5271#true} is VALID [2022-04-27 10:32:16,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5271#true} {5271#true} #42#return; {5271#true} is VALID [2022-04-27 10:32:16,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume true; {5271#true} is VALID [2022-04-27 10:32:16,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#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); {5271#true} is VALID [2022-04-27 10:32:16,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {5271#true} call ULTIMATE.init(); {5271#true} is VALID [2022-04-27 10:32:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:32:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417574440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:32:16,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:32:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:32:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310488311] [2022-04-27 10:32:16,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:32:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-27 10:32:16,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:32:16,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:32:16,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:32:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:32:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:32:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:32:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:32:16,414 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:39,351 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-04-27 10:33:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-27 10:33:39,351 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-27 10:33:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:33:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 158 transitions. [2022-04-27 10:33:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 158 transitions. [2022-04-27 10:33:39,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 158 transitions. [2022-04-27 10:33:39,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:33:39,822 INFO L225 Difference]: With dead ends: 182 [2022-04-27 10:33:39,822 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 10:33:39,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 80.3s TimeCoverageRelationStatistics Valid=2515, Invalid=6796, Unknown=1, NotChecked=0, Total=9312 [2022-04-27 10:33:39,824 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:33:39,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 128 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 10:33:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 10:33:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-04-27 10:33:40,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:33:40,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:40,010 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:40,010 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:40,013 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2022-04-27 10:33:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2022-04-27 10:33:40,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:33:40,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:33:40,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 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 177 states. [2022-04-27 10:33:40,013 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 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 177 states. [2022-04-27 10:33:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:33:40,015 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2022-04-27 10:33:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2022-04-27 10:33:40,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:33:40,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:33:40,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:33:40,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:33:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2022-04-27 10:33:40,018 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 55 [2022-04-27 10:33:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:33:40,018 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2022-04-27 10:33:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.0) internal successors, (100), 49 states have internal predecessors, (100), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2022-04-27 10:33:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 10:33:40,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:33:40,019 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:33:40,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:33:40,235 WARN L477 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-27 10:33:40,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:33:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:33:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1992848505, now seen corresponding path program 4 times [2022-04-27 10:33:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:33:40,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809442738] [2022-04-27 10:33:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:33:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:33:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:33:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:33:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:33:41,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {6685#(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); {6642#true} is VALID [2022-04-27 10:33:41,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-27 10:33:41,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6642#true} {6642#true} #42#return; {6642#true} is VALID [2022-04-27 10:33:41,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:33:41,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {6685#(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); {6642#true} is VALID [2022-04-27 10:33:41,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-27 10:33:41,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #42#return; {6642#true} is VALID [2022-04-27 10:33:41,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-27 10:33:41,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6647#(= main_~x~0 0)} is VALID [2022-04-27 10:33:41,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {6647#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6647#(= main_~x~0 0)} is VALID [2022-04-27 10:33:41,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {6647#(= 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; {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:33:41,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:33:41,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {6648#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:33:41,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:33:41,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {6649#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:33:41,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:33:41,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {6650#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:33:41,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:33:41,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {6651#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:33:41,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:33:41,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:33:41,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:33:41,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {6653#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:33:41,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:33:41,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {6654#(and (<= main_~x~0 7) (<= 7 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:33:41,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:33:41,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {6655#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:33:41,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:33:41,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {6656#(and (<= main_~x~0 9) (<= 9 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:33:41,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:33:41,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {6657#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:33:41,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:33:41,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {6658#(and (<= main_~x~0 11) (<= 11 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:33:41,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:33:41,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {6659#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:33:41,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:33:41,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {6660#(and (<= main_~x~0 13) (<= 13 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:33:41,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:33:41,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:33:41,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:33:41,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} 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; {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:33:41,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:33:41,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {6663#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 10:33:41,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 99); {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 10:33:41,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {6664#(and (<= 17 main_~x~0) (<= main_~x~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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:33:41,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:33:41,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {6665#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 10:33:41,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 99); {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 10:33:41,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} 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; {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:33:41,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:33:41,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {6667#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 10:33:41,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 99); {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 10:33:41,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} 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; {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:33:41,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:33:41,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {6669#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 10:33:41,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 99); {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 10:33:41,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} 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; {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:33:41,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:33:41,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {6671#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 10:33:41,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 10:33:41,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {6672#(and (<= main_~x~0 25) (<= 25 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:33:41,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:33:41,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {6673#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 10:33:41,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 99); {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 10:33:41,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} 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; {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:33:41,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:33:41,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {6675#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 10:33:41,145 INFO L290 TraceCheckUtils]: 64: Hoare triple {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 10:33:41,145 INFO L290 TraceCheckUtils]: 65: Hoare triple {6676#(and (<= main_~x~0 29) (<= 29 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:33:41,146 INFO L290 TraceCheckUtils]: 66: Hoare triple {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:33:41,146 INFO L290 TraceCheckUtils]: 67: Hoare triple {6677#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 10:33:41,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 99); {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 10:33:41,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} 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; {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:33:41,147 INFO L290 TraceCheckUtils]: 70: Hoare triple {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:33:41,147 INFO L290 TraceCheckUtils]: 71: Hoare triple {6679#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 10:33:41,148 INFO L290 TraceCheckUtils]: 72: Hoare triple {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 10:33:41,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {6680#(and (<= main_~x~0 33) (<= 33 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:33:41,149 INFO L290 TraceCheckUtils]: 74: Hoare triple {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:33:41,149 INFO L290 TraceCheckUtils]: 75: Hoare triple {6681#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 10:33:41,149 INFO L290 TraceCheckUtils]: 76: Hoare triple {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 99); {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 10:33:41,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} 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; {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:33:41,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:33:41,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {6683#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6684#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:33:41,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {6684#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {6643#false} is VALID [2022-04-27 10:33:41,151 INFO L272 TraceCheckUtils]: 81: Hoare triple {6643#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)); {6643#false} is VALID [2022-04-27 10:33:41,151 INFO L290 TraceCheckUtils]: 82: Hoare triple {6643#false} ~cond := #in~cond; {6643#false} is VALID [2022-04-27 10:33:41,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {6643#false} assume 0 == ~cond; {6643#false} is VALID [2022-04-27 10:33:41,151 INFO L290 TraceCheckUtils]: 84: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-27 10:33:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:33:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:33:41,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809442738] [2022-04-27 10:33:41,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809442738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:33:41,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141794781] [2022-04-27 10:33:41,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:33:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:33:41,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:33:41,167 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:33:41,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:33:41,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:33:41,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:33:41,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-27 10:33:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:33:41,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:33:41,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-27 10:33:41,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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); {6642#true} is VALID [2022-04-27 10:33:41,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-27 10:33:41,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #42#return; {6642#true} is VALID [2022-04-27 10:33:41,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-27 10:33:41,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {6647#(= main_~x~0 0)} is VALID [2022-04-27 10:33:41,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {6647#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {6647#(= main_~x~0 0)} is VALID [2022-04-27 10:33:41,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {6647#(= 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; {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:33:41,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {6648#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:33:41,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {6648#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:33:41,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6649#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:33:41,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {6649#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:33:41,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6650#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:33:41,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {6650#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:33:41,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6651#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:33:41,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {6651#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:33:41,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:33:41,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {6652#(and (<= 5 main_~x~0) (<= main_~x~0 5))} 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; {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:33:41,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {6653#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:33:41,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {6653#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:33:41,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6654#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:33:41,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {6654#(and (<= main_~x~0 7) (<= 7 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:33:41,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6655#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:33:42,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {6655#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:33:42,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6656#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 10:33:42,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {6656#(and (<= main_~x~0 9) (<= 9 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:33:42,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6657#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:33:42,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {6657#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:33:42,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6658#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 10:33:42,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {6658#(and (<= main_~x~0 11) (<= 11 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:33:42,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6659#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:33:42,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {6659#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:33:42,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6660#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 10:33:42,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {6660#(and (<= main_~x~0 13) (<= 13 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:33:42,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {6661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:33:42,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:33:42,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 10:33:42,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {6662#(and (<= 15 main_~x~0) (<= main_~x~0 15))} 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; {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:33:42,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6663#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:33:42,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {6663#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 10:33:42,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 99); {6664#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 10:33:42,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {6664#(and (<= 17 main_~x~0) (<= main_~x~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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:33:42,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6665#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:33:42,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {6665#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 10:33:42,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 99); {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 10:33:42,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {6666#(and (<= 19 main_~x~0) (<= main_~x~0 19))} 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; {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:33:42,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6667#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:33:42,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {6667#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 10:33:42,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 99); {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 10:33:42,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {6668#(and (<= 21 main_~x~0) (<= main_~x~0 21))} 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; {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:33:42,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {6669#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:33:42,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {6669#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 10:33:42,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 99); {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 10:33:42,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {6670#(and (<= 23 main_~x~0) (<= main_~x~0 23))} 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; {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:33:42,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6671#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:33:42,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {6671#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 10:33:42,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6672#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 10:33:42,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {6672#(and (<= main_~x~0 25) (<= 25 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:33:42,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6673#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:33:42,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {6673#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 10:33:42,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 99); {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 10:33:42,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {6674#(and (<= 27 main_~x~0) (<= main_~x~0 27))} 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; {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:33:42,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {6675#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:33:42,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {6675#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 10:33:42,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6676#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 10:33:42,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {6676#(and (<= main_~x~0 29) (<= 29 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:33:42,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6677#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:33:42,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {6677#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 10:33:42,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 99); {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 10:33:42,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {6678#(and (<= 31 main_~x~0) (<= main_~x~0 31))} 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; {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:33:42,017 INFO L290 TraceCheckUtils]: 70: Hoare triple {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6679#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:33:42,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {6679#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 10:33:42,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6680#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 10:33:42,018 INFO L290 TraceCheckUtils]: 73: Hoare triple {6680#(and (<= main_~x~0 33) (<= 33 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:33:42,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6681#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:33:42,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {6681#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 10:33:42,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 99); {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 10:33:42,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {6682#(and (<= 35 main_~x~0) (<= main_~x~0 35))} 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; {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:33:42,020 INFO L290 TraceCheckUtils]: 78: Hoare triple {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6683#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:33:42,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {6683#(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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6926#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 10:33:42,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {6926#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6643#false} is VALID [2022-04-27 10:33:42,021 INFO L272 TraceCheckUtils]: 81: Hoare triple {6643#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)); {6643#false} is VALID [2022-04-27 10:33:42,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {6643#false} ~cond := #in~cond; {6643#false} is VALID [2022-04-27 10:33:42,021 INFO L290 TraceCheckUtils]: 83: Hoare triple {6643#false} assume 0 == ~cond; {6643#false} is VALID [2022-04-27 10:33:42,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-27 10:33:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:33:42,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:33:44,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-27 10:33:44,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {6643#false} assume 0 == ~cond; {6643#false} is VALID [2022-04-27 10:33:44,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {6643#false} ~cond := #in~cond; {6643#false} is VALID [2022-04-27 10:33:44,385 INFO L272 TraceCheckUtils]: 81: Hoare triple {6643#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)); {6643#false} is VALID [2022-04-27 10:33:44,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {6954#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {6643#false} is VALID [2022-04-27 10:33:44,386 INFO L290 TraceCheckUtils]: 79: Hoare triple {6958#(< (mod (+ main_~x~0 1) 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; {6954#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:33:44,386 INFO L290 TraceCheckUtils]: 78: Hoare triple {6958#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6958#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:33:44,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {6965#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6958#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:33:44,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {6965#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6965#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:33:44,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {6972#(< (mod (+ main_~x~0 3) 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; {6965#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:33:44,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {6972#(< (mod (+ main_~x~0 3) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6972#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:33:44,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {6979#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6972#(< (mod (+ main_~x~0 3) 4294967296) 99)} is VALID [2022-04-27 10:33:44,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {6979#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6979#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:33:44,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {6986#(< (mod (+ 5 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; {6979#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:33:44,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {6986#(< (mod (+ 5 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6986#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {6993#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6986#(< (mod (+ 5 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {6993#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {6993#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:33:44,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {7000#(< (mod (+ 7 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; {6993#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:33:44,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {7000#(< (mod (+ 7 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7000#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {7007#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7000#(< (mod (+ 7 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {7007#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7007#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:33:44,393 INFO L290 TraceCheckUtils]: 63: Hoare triple {7014#(< (mod (+ main_~x~0 9) 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; {7007#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:33:44,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {7014#(< (mod (+ main_~x~0 9) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7014#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-27 10:33:44,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {7021#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7014#(< (mod (+ main_~x~0 9) 4294967296) 99)} is VALID [2022-04-27 10:33:44,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {7021#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7021#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:33:44,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {7028#(< (mod (+ main_~x~0 11) 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; {7021#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:33:44,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {7028#(< (mod (+ main_~x~0 11) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7028#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-27 10:33:44,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {7035#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7028#(< (mod (+ main_~x~0 11) 4294967296) 99)} is VALID [2022-04-27 10:33:44,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {7035#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7035#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:33:44,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {7042#(< (mod (+ main_~x~0 13) 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; {7035#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:33:44,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {7042#(< (mod (+ main_~x~0 13) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7042#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-27 10:33:44,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {7049#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7042#(< (mod (+ main_~x~0 13) 4294967296) 99)} is VALID [2022-04-27 10:33:44,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {7049#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7049#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:33:44,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {7056#(< (mod (+ main_~x~0 15) 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; {7049#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:33:44,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {7056#(< (mod (+ main_~x~0 15) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7056#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-27 10:33:44,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {7063#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7056#(< (mod (+ main_~x~0 15) 4294967296) 99)} is VALID [2022-04-27 10:33:44,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {7063#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7063#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:33:44,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {7070#(< (mod (+ main_~x~0 17) 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; {7063#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:33:44,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {7070#(< (mod (+ main_~x~0 17) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7070#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-27 10:33:44,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {7077#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7070#(< (mod (+ main_~x~0 17) 4294967296) 99)} is VALID [2022-04-27 10:33:44,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {7077#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7077#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:33:44,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {7084#(< (mod (+ 19 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; {7077#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:33:44,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {7084#(< (mod (+ 19 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7084#(< (mod (+ 19 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {7091#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7084#(< (mod (+ 19 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {7091#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7091#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:33:44,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {7098#(< (mod (+ main_~x~0 21) 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; {7091#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:33:44,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {7098#(< (mod (+ main_~x~0 21) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7098#(< (mod (+ main_~x~0 21) 4294967296) 99)} is VALID [2022-04-27 10:33:44,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {7105#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7098#(< (mod (+ main_~x~0 21) 4294967296) 99)} is VALID [2022-04-27 10:33:44,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {7105#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7105#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:33:44,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {7112#(< (mod (+ 23 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; {7105#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:33:44,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {7112#(< (mod (+ 23 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7112#(< (mod (+ 23 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {7119#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7112#(< (mod (+ 23 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {7119#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7119#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:33:44,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#(< (mod (+ main_~x~0 25) 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; {7119#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:33:44,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#(< (mod (+ main_~x~0 25) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7126#(< (mod (+ main_~x~0 25) 4294967296) 99)} is VALID [2022-04-27 10:33:44,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {7133#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7126#(< (mod (+ main_~x~0 25) 4294967296) 99)} is VALID [2022-04-27 10:33:44,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {7133#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7133#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:33:44,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {7140#(< (mod (+ main_~x~0 27) 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; {7133#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:33:44,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {7140#(< (mod (+ main_~x~0 27) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7140#(< (mod (+ main_~x~0 27) 4294967296) 99)} is VALID [2022-04-27 10:33:44,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {7147#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7140#(< (mod (+ main_~x~0 27) 4294967296) 99)} is VALID [2022-04-27 10:33:44,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {7147#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7147#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:33:44,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {7154#(< (mod (+ 29 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; {7147#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:33:44,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {7154#(< (mod (+ 29 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7154#(< (mod (+ 29 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {7161#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7154#(< (mod (+ 29 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {7161#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7161#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {7168#(< (mod (+ main_~x~0 31) 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; {7161#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {7168#(< (mod (+ main_~x~0 31) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7168#(< (mod (+ main_~x~0 31) 4294967296) 99)} is VALID [2022-04-27 10:33:44,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {7175#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7168#(< (mod (+ main_~x~0 31) 4294967296) 99)} is VALID [2022-04-27 10:33:44,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {7175#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7175#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {7182#(< (mod (+ main_~x~0 33) 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; {7175#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {7182#(< (mod (+ main_~x~0 33) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7182#(< (mod (+ main_~x~0 33) 4294967296) 99)} is VALID [2022-04-27 10:33:44,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {7189#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7182#(< (mod (+ main_~x~0 33) 4294967296) 99)} is VALID [2022-04-27 10:33:44,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {7189#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7189#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:33:44,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {7196#(< (mod (+ 35 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; {7189#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:33:44,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {7196#(< (mod (+ 35 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7196#(< (mod (+ 35 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {7203#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {7196#(< (mod (+ 35 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:33:44,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {7203#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7203#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:33:44,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {7210#(< (mod (+ main_~x~0 37) 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; {7203#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:33:44,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {7210#(< (mod (+ main_~x~0 37) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {7210#(< (mod (+ main_~x~0 37) 4294967296) 99)} is VALID [2022-04-27 10:33:44,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {7210#(< (mod (+ main_~x~0 37) 4294967296) 99)} is VALID [2022-04-27 10:33:44,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-27 10:33:44,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #42#return; {6642#true} is VALID [2022-04-27 10:33:44,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-27 10:33:44,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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); {6642#true} is VALID [2022-04-27 10:33:44,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-27 10:33:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:33:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141794781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:33:44,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:33:44,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-27 10:33:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100548516] [2022-04-27 10:33:44,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:33:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 10:33:44,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:33:44,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:33:44,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:33:44,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-27 10:33:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:33:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-27 10:33:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-27 10:33:44,540 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:38:09,761 WARN L232 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 156 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:41:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:52,403 INFO L93 Difference]: Finished difference Result 262 states and 283 transitions. [2022-04-27 10:41:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-27 10:41:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-27 10:41:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:41:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 227 transitions. [2022-04-27 10:41:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 227 transitions. [2022-04-27 10:41:52,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 227 transitions. [2022-04-27 10:41:52,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:41:52,852 INFO L225 Difference]: With dead ends: 262 [2022-04-27 10:41:52,852 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 10:41:52,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 482.3s TimeCoverageRelationStatistics Valid=6303, Invalid=17866, Unknown=11, NotChecked=0, Total=24180 [2022-04-27 10:41:52,857 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:41:52,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 203 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 10:41:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 10:41:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-04-27 10:41:53,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:41:53,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:53,110 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:53,110 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:53,113 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2022-04-27 10:41:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 259 transitions. [2022-04-27 10:41:53,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:53,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:53,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 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 257 states. [2022-04-27 10:41:53,114 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 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 257 states. [2022-04-27 10:41:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:41:53,117 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2022-04-27 10:41:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 259 transitions. [2022-04-27 10:41:53,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:41:53,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:41:53,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:41:53,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:41:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.0119047619047619) internal successors, (255), 252 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 259 transitions. [2022-04-27 10:41:53,121 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 259 transitions. Word has length 85 [2022-04-27 10:41:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:41:53,121 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 259 transitions. [2022-04-27 10:41:53,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.0) internal successors, (160), 79 states have internal predecessors, (160), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:41:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 259 transitions. [2022-04-27 10:41:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 10:41:53,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:41:53,122 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:41:53,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 10:41:53,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 10:41:53,331 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:41:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:41:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash -726945214, now seen corresponding path program 5 times [2022-04-27 10:41:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:41:53,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713437317] [2022-04-27 10:41:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:41:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:41:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:41:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:41:54,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {8733#(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); {8681#true} is VALID [2022-04-27 10:41:54,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8681#true} assume true; {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8681#true} {8681#true} #42#return; {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {8681#true} call ULTIMATE.init(); {8733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:41:54,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {8733#(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); {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {8681#true} assume true; {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8681#true} {8681#true} #42#return; {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {8681#true} call #t~ret6 := main(); {8681#true} is VALID [2022-04-27 10:41:54,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {8681#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8686#(= main_~x~0 0)} is VALID [2022-04-27 10:41:54,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {8686#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {8686#(= main_~x~0 0)} is VALID [2022-04-27 10:41:54,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {8686#(= 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; {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:41:54,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:41:54,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {8687#(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; {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:41:54,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:41:54,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {8688#(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; {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:41:54,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:41:54,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {8689#(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; {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:41:54,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:41:54,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {8690#(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; {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:41:54,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:41:54,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {8691#(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; {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:41:54,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:41:54,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {8692#(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; {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:41:54,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:41:54,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {8693#(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; {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:41:54,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:41:54,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {8694#(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; {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:41:54,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:41:54,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {8695#(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; {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:41:54,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:41:54,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {8696#(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; {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:41:54,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:41:54,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {8697#(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; {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:41:54,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:41:54,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {8698#(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; {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:41:54,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:41:54,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {8699#(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; {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:41:54,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:41:54,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#(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; {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:41:54,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:41:54,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {8701#(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; {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:41:54,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:41:54,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {8702#(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; {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:41:54,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:41:54,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {8703#(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; {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:41:54,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:41:54,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {8704#(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; {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:41:54,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:41:54,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {8705#(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; {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:41:54,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:41:54,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {8706#(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; {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:41:54,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:41:54,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {8707#(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; {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:41:54,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:41:54,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {8708#(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; {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:41:54,511 INFO L290 TraceCheckUtils]: 52: Hoare triple {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:41:54,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {8709#(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; {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:41:54,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:41:54,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {8710#(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; {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:41:54,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:41:54,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {8711#(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; {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:41:54,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:41:54,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {8712#(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; {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:41:54,514 INFO L290 TraceCheckUtils]: 60: Hoare triple {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:41:54,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {8713#(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; {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:41:54,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:41:54,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {8714#(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; {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:41:54,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:41:54,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {8715#(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; {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:41:54,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:41:54,517 INFO L290 TraceCheckUtils]: 67: Hoare triple {8716#(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; {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-27 10:41:54,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-27 10:41:54,517 INFO L290 TraceCheckUtils]: 69: Hoare triple {8717#(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; {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-27 10:41:54,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-27 10:41:54,518 INFO L290 TraceCheckUtils]: 71: Hoare triple {8718#(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; {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-27 10:41:54,518 INFO L290 TraceCheckUtils]: 72: Hoare triple {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-27 10:41:54,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {8719#(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; {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-27 10:41:54,519 INFO L290 TraceCheckUtils]: 74: Hoare triple {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-27 10:41:54,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {8720#(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; {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-27 10:41:54,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-27 10:41:54,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {8721#(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; {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-27 10:41:54,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-27 10:41:54,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#(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; {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-27 10:41:54,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-27 10:41:54,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {8723#(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; {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-27 10:41:54,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-27 10:41:54,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {8724#(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; {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-27 10:41:54,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-27 10:41:54,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {8725#(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; {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-27 10:41:54,524 INFO L290 TraceCheckUtils]: 86: Hoare triple {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-27 10:41:54,524 INFO L290 TraceCheckUtils]: 87: Hoare triple {8726#(and (<= 80 main_~x~0) (<= 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; {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-27 10:41:54,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-27 10:41:54,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-27 10:41:54,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-27 10:41:54,525 INFO L290 TraceCheckUtils]: 91: Hoare triple {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-27 10:41:54,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-27 10:41:54,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {8729#(and (<= main_~x~0 86) (<= 86 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; {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-27 10:41:54,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-27 10:41:54,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {8730#(and (<= main_~x~0 88) (<= 88 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; {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-27 10:41:54,527 INFO L290 TraceCheckUtils]: 96: Hoare triple {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-27 10:41:54,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8732#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:41:54,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {8732#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {8682#false} is VALID [2022-04-27 10:41:54,528 INFO L272 TraceCheckUtils]: 99: Hoare triple {8682#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)); {8682#false} is VALID [2022-04-27 10:41:54,528 INFO L290 TraceCheckUtils]: 100: Hoare triple {8682#false} ~cond := #in~cond; {8682#false} is VALID [2022-04-27 10:41:54,528 INFO L290 TraceCheckUtils]: 101: Hoare triple {8682#false} assume 0 == ~cond; {8682#false} is VALID [2022-04-27 10:41:54,528 INFO L290 TraceCheckUtils]: 102: Hoare triple {8682#false} assume !false; {8682#false} is VALID [2022-04-27 10:41:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:41:54,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:41:54,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713437317] [2022-04-27 10:41:54,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713437317] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:41:54,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550521810] [2022-04-27 10:41:54,530 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:41:54,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:41:54,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:41:54,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:41:54,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:43:04,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 10:43:04,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:43:04,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-27 10:43:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:43:04,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:43:04,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {8681#true} call ULTIMATE.init(); {8681#true} is VALID [2022-04-27 10:43:04,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {8681#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); {8681#true} is VALID [2022-04-27 10:43:04,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {8681#true} assume true; {8681#true} is VALID [2022-04-27 10:43:04,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8681#true} {8681#true} #42#return; {8681#true} is VALID [2022-04-27 10:43:04,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {8681#true} call #t~ret6 := main(); {8681#true} is VALID [2022-04-27 10:43:04,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {8681#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {8686#(= main_~x~0 0)} is VALID [2022-04-27 10:43:04,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {8686#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {8686#(= main_~x~0 0)} is VALID [2022-04-27 10:43:04,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {8686#(= 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; {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:43:04,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8687#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:43:04,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {8687#(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; {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:43:04,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8688#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:43:04,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {8688#(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; {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:43:04,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 99); {8689#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:43:04,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {8689#(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; {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:43:04,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:43:04,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {8690#(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; {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:43:04,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8691#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 10:43:04,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {8691#(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; {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:43:04,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8692#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 10:43:04,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {8692#(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; {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:43:04,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 99); {8693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 10:43:04,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {8693#(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; {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:43:04,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8694#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 10:43:04,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {8694#(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; {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:43:04,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8695#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 10:43:04,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {8695#(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; {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:43:04,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8696#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 10:43:04,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {8696#(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; {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:43:04,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 99); {8697#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 10:43:04,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {8697#(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; {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:43:04,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8698#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 10:43:04,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {8698#(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; {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:43:04,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8699#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 10:43:04,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {8699#(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; {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:43:04,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 99); {8700#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 10:43:04,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#(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; {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:43:04,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {8701#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 10:43:04,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {8701#(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; {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:43:04,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8702#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 10:43:04,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {8702#(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; {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:43:04,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 10:43:04,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {8703#(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; {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:43:04,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8704#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 10:43:04,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {8704#(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; {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:43:04,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8705#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 10:43:04,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {8705#(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; {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:43:04,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8706#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 10:43:04,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {8706#(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; {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:43:04,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8707#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 10:43:04,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {8707#(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; {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:43:04,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {8708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 10:43:04,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {8708#(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; {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:43:04,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 99); {8709#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 10:43:04,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {8709#(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; {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:43:04,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8710#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 10:43:04,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {8710#(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; {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:43:04,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8711#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 10:43:04,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {8711#(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; {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:43:04,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8712#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 10:43:04,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {8712#(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; {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:43:04,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8713#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 10:43:04,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {8713#(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; {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:43:04,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8714#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 10:43:04,915 INFO L290 TraceCheckUtils]: 63: Hoare triple {8714#(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; {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:43:04,915 INFO L290 TraceCheckUtils]: 64: Hoare triple {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 99); {8715#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-27 10:43:04,915 INFO L290 TraceCheckUtils]: 65: Hoare triple {8715#(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; {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:43:04,916 INFO L290 TraceCheckUtils]: 66: Hoare triple {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8716#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-27 10:43:04,916 INFO L290 TraceCheckUtils]: 67: Hoare triple {8716#(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; {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-27 10:43:04,916 INFO L290 TraceCheckUtils]: 68: Hoare triple {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 99); {8717#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-27 10:43:04,917 INFO L290 TraceCheckUtils]: 69: Hoare triple {8717#(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; {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-27 10:43:04,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8718#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-27 10:43:04,918 INFO L290 TraceCheckUtils]: 71: Hoare triple {8718#(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; {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-27 10:43:04,918 INFO L290 TraceCheckUtils]: 72: Hoare triple {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 99); {8719#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-27 10:43:04,918 INFO L290 TraceCheckUtils]: 73: Hoare triple {8719#(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; {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-27 10:43:04,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8720#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-27 10:43:04,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {8720#(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; {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-27 10:43:04,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8721#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-27 10:43:04,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {8721#(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; {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-27 10:43:04,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 99); {8722#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-27 10:43:04,921 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#(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; {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-27 10:43:04,921 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 99); {8723#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-27 10:43:04,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {8723#(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; {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-27 10:43:04,922 INFO L290 TraceCheckUtils]: 82: Hoare triple {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 99); {8724#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-27 10:43:04,922 INFO L290 TraceCheckUtils]: 83: Hoare triple {8724#(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; {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-27 10:43:04,922 INFO L290 TraceCheckUtils]: 84: Hoare triple {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 99); {8725#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-27 10:43:04,923 INFO L290 TraceCheckUtils]: 85: Hoare triple {8725#(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; {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-27 10:43:04,923 INFO L290 TraceCheckUtils]: 86: Hoare triple {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 99); {8726#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-27 10:43:04,924 INFO L290 TraceCheckUtils]: 87: Hoare triple {8726#(and (<= 80 main_~x~0) (<= 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; {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-27 10:43:04,924 INFO L290 TraceCheckUtils]: 88: Hoare triple {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 99); {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-27 10:43:04,924 INFO L290 TraceCheckUtils]: 89: Hoare triple {8727#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-27 10:43:04,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 99); {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-27 10:43:04,925 INFO L290 TraceCheckUtils]: 91: Hoare triple {8728#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-27 10:43:04,925 INFO L290 TraceCheckUtils]: 92: Hoare triple {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8729#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-27 10:43:04,926 INFO L290 TraceCheckUtils]: 93: Hoare triple {8729#(and (<= main_~x~0 86) (<= 86 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; {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-27 10:43:04,926 INFO L290 TraceCheckUtils]: 94: Hoare triple {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8730#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-27 10:43:04,927 INFO L290 TraceCheckUtils]: 95: Hoare triple {8730#(and (<= main_~x~0 88) (<= 88 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; {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-27 10:43:04,927 INFO L290 TraceCheckUtils]: 96: Hoare triple {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 99); {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-27 10:43:04,927 INFO L290 TraceCheckUtils]: 97: Hoare triple {8731#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9028#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-27 10:43:04,928 INFO L290 TraceCheckUtils]: 98: Hoare triple {9028#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {8682#false} is VALID [2022-04-27 10:43:04,928 INFO L272 TraceCheckUtils]: 99: Hoare triple {8682#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)); {8682#false} is VALID [2022-04-27 10:43:04,928 INFO L290 TraceCheckUtils]: 100: Hoare triple {8682#false} ~cond := #in~cond; {8682#false} is VALID [2022-04-27 10:43:04,928 INFO L290 TraceCheckUtils]: 101: Hoare triple {8682#false} assume 0 == ~cond; {8682#false} is VALID [2022-04-27 10:43:04,928 INFO L290 TraceCheckUtils]: 102: Hoare triple {8682#false} assume !false; {8682#false} is VALID [2022-04-27 10:43:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:43:04,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:43:07,855 INFO L290 TraceCheckUtils]: 102: Hoare triple {8682#false} assume !false; {8682#false} is VALID [2022-04-27 10:43:07,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {8682#false} assume 0 == ~cond; {8682#false} is VALID [2022-04-27 10:43:07,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {8682#false} ~cond := #in~cond; {8682#false} is VALID [2022-04-27 10:43:07,856 INFO L272 TraceCheckUtils]: 99: Hoare triple {8682#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)); {8682#false} is VALID [2022-04-27 10:43:07,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {9056#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {8682#false} is VALID [2022-04-27 10:43:07,857 INFO L290 TraceCheckUtils]: 97: Hoare triple {9060#(< (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; {9056#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:43:07,857 INFO L290 TraceCheckUtils]: 96: Hoare triple {9060#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9060#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:43:07,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {9067#(< (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; {9060#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:43:07,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {9067#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9067#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:43:07,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {9074#(< (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; {9067#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-27 10:43:07,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {9074#(< (mod (+ main_~x~0 6) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9074#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:43:07,859 INFO L290 TraceCheckUtils]: 91: Hoare triple {9081#(< (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; {9074#(< (mod (+ main_~x~0 6) 4294967296) 99)} is VALID [2022-04-27 10:43:07,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {9081#(< (mod (+ main_~x~0 8) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9081#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:43:07,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {9088#(< (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; {9081#(< (mod (+ main_~x~0 8) 4294967296) 99)} is VALID [2022-04-27 10:43:07,861 INFO L290 TraceCheckUtils]: 88: Hoare triple {9088#(< (mod (+ main_~x~0 10) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9088#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:43:07,861 INFO L290 TraceCheckUtils]: 87: Hoare triple {9095#(< (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; {9088#(< (mod (+ main_~x~0 10) 4294967296) 99)} is VALID [2022-04-27 10:43:07,861 INFO L290 TraceCheckUtils]: 86: Hoare triple {9095#(< (mod (+ main_~x~0 12) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9095#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:43:07,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {9102#(< (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; {9095#(< (mod (+ main_~x~0 12) 4294967296) 99)} is VALID [2022-04-27 10:43:07,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {9102#(< (mod (+ main_~x~0 14) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9102#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:43:07,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {9109#(< (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; {9102#(< (mod (+ main_~x~0 14) 4294967296) 99)} is VALID [2022-04-27 10:43:07,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {9109#(< (mod (+ main_~x~0 16) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9109#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:43:07,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {9116#(< (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; {9109#(< (mod (+ main_~x~0 16) 4294967296) 99)} is VALID [2022-04-27 10:43:07,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {9116#(< (mod (+ main_~x~0 18) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9116#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:43:07,867 INFO L290 TraceCheckUtils]: 79: Hoare triple {9123#(< (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; {9116#(< (mod (+ main_~x~0 18) 4294967296) 99)} is VALID [2022-04-27 10:43:07,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {9123#(< (mod (+ main_~x~0 20) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9123#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:43:07,868 INFO L290 TraceCheckUtils]: 77: Hoare triple {9130#(< (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; {9123#(< (mod (+ main_~x~0 20) 4294967296) 99)} is VALID [2022-04-27 10:43:07,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {9130#(< (mod (+ main_~x~0 22) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9130#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:43:07,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {9137#(< (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; {9130#(< (mod (+ main_~x~0 22) 4294967296) 99)} is VALID [2022-04-27 10:43:07,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {9137#(< (mod (+ main_~x~0 24) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9137#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:43:07,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {9144#(< (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; {9137#(< (mod (+ main_~x~0 24) 4294967296) 99)} is VALID [2022-04-27 10:43:07,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {9144#(< (mod (+ main_~x~0 26) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9144#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:43:07,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {9151#(< (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; {9144#(< (mod (+ main_~x~0 26) 4294967296) 99)} is VALID [2022-04-27 10:43:07,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {9151#(< (mod (+ main_~x~0 28) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9151#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:43:07,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {9158#(< (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; {9151#(< (mod (+ main_~x~0 28) 4294967296) 99)} is VALID [2022-04-27 10:43:07,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {9158#(< (mod (+ 30 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9158#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {9165#(< (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; {9158#(< (mod (+ 30 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {9165#(< (mod (+ 32 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9165#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {9172#(< (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; {9165#(< (mod (+ 32 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {9172#(< (mod (+ main_~x~0 34) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9172#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:43:07,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {9179#(< (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; {9172#(< (mod (+ main_~x~0 34) 4294967296) 99)} is VALID [2022-04-27 10:43:07,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {9179#(< (mod (+ main_~x~0 36) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9179#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:43:07,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {9186#(< (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; {9179#(< (mod (+ main_~x~0 36) 4294967296) 99)} is VALID [2022-04-27 10:43:07,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {9186#(< (mod (+ main_~x~0 38) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9186#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-27 10:43:07,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {9193#(< (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; {9186#(< (mod (+ main_~x~0 38) 4294967296) 99)} is VALID [2022-04-27 10:43:07,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {9193#(< (mod (+ 40 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9193#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {9200#(< (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; {9193#(< (mod (+ 40 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {9200#(< (mod (+ 42 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9200#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {9207#(< (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; {9200#(< (mod (+ 42 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {9207#(< (mod (+ 44 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9207#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {9214#(< (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; {9207#(< (mod (+ 44 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {9214#(< (mod (+ main_~x~0 46) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9214#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-27 10:43:07,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {9221#(< (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; {9214#(< (mod (+ main_~x~0 46) 4294967296) 99)} is VALID [2022-04-27 10:43:07,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {9221#(< (mod (+ main_~x~0 48) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9221#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-27 10:43:07,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {9228#(< (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; {9221#(< (mod (+ main_~x~0 48) 4294967296) 99)} is VALID [2022-04-27 10:43:07,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {9228#(< (mod (+ main_~x~0 50) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9228#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-27 10:43:07,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {9235#(< (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; {9228#(< (mod (+ main_~x~0 50) 4294967296) 99)} is VALID [2022-04-27 10:43:07,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {9235#(< (mod (+ main_~x~0 52) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9235#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-27 10:43:07,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {9242#(< (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; {9235#(< (mod (+ main_~x~0 52) 4294967296) 99)} is VALID [2022-04-27 10:43:07,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {9242#(< (mod (+ main_~x~0 54) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9242#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-27 10:43:07,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {9249#(< (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; {9242#(< (mod (+ main_~x~0 54) 4294967296) 99)} is VALID [2022-04-27 10:43:07,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {9249#(< (mod (+ 56 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9249#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {9256#(< (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; {9249#(< (mod (+ 56 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {9256#(< (mod (+ main_~x~0 58) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9256#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-27 10:43:07,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {9263#(< (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; {9256#(< (mod (+ main_~x~0 58) 4294967296) 99)} is VALID [2022-04-27 10:43:07,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {9263#(< (mod (+ main_~x~0 60) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9263#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-27 10:43:07,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {9270#(< (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; {9263#(< (mod (+ main_~x~0 60) 4294967296) 99)} is VALID [2022-04-27 10:43:07,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {9270#(< (mod (+ main_~x~0 62) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9270#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-27 10:43:07,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {9277#(< (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; {9270#(< (mod (+ main_~x~0 62) 4294967296) 99)} is VALID [2022-04-27 10:43:07,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {9277#(< (mod (+ 64 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9277#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {9284#(< (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; {9277#(< (mod (+ 64 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {9284#(< (mod (+ 66 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9284#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {9291#(< (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; {9284#(< (mod (+ 66 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {9291#(< (mod (+ 68 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9291#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {9298#(< (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; {9291#(< (mod (+ 68 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {9298#(< (mod (+ main_~x~0 70) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9298#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-27 10:43:07,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {9305#(< (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; {9298#(< (mod (+ main_~x~0 70) 4294967296) 99)} is VALID [2022-04-27 10:43:07,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {9305#(< (mod (+ 72 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9305#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#(< (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; {9305#(< (mod (+ 72 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {9312#(< (mod (+ main_~x~0 74) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9312#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-27 10:43:07,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {9319#(< (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; {9312#(< (mod (+ main_~x~0 74) 4294967296) 99)} is VALID [2022-04-27 10:43:07,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {9319#(< (mod (+ 76 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9319#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {9326#(< (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; {9319#(< (mod (+ 76 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {9326#(< (mod (+ main_~x~0 78) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9326#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-27 10:43:07,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {9333#(< (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; {9326#(< (mod (+ main_~x~0 78) 4294967296) 99)} is VALID [2022-04-27 10:43:07,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {9333#(< (mod (+ main_~x~0 80) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9333#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-27 10:43:07,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {9340#(< (mod (+ main_~x~0 82) 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; {9333#(< (mod (+ main_~x~0 80) 4294967296) 99)} is VALID [2022-04-27 10:43:07,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {9340#(< (mod (+ main_~x~0 82) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9340#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-27 10:43:07,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {9347#(< (mod (+ 84 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; {9340#(< (mod (+ main_~x~0 82) 4294967296) 99)} is VALID [2022-04-27 10:43:07,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {9347#(< (mod (+ 84 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9347#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {9354#(< (mod (+ main_~x~0 86) 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; {9347#(< (mod (+ 84 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {9354#(< (mod (+ main_~x~0 86) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9354#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-27 10:43:07,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {9361#(< (mod (+ 88 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; {9354#(< (mod (+ main_~x~0 86) 4294967296) 99)} is VALID [2022-04-27 10:43:07,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {9361#(< (mod (+ 88 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9361#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {9368#(< (mod (+ main_~x~0 90) 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; {9361#(< (mod (+ 88 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {9368#(< (mod (+ main_~x~0 90) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9368#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-27 10:43:07,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {9375#(< (mod (+ 92 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; {9368#(< (mod (+ main_~x~0 90) 4294967296) 99)} is VALID [2022-04-27 10:43:07,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {9375#(< (mod (+ 92 main_~x~0) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {9375#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {8681#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {9375#(< (mod (+ 92 main_~x~0) 4294967296) 99)} is VALID [2022-04-27 10:43:07,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {8681#true} call #t~ret6 := main(); {8681#true} is VALID [2022-04-27 10:43:07,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8681#true} {8681#true} #42#return; {8681#true} is VALID [2022-04-27 10:43:07,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {8681#true} assume true; {8681#true} is VALID [2022-04-27 10:43:07,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {8681#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); {8681#true} is VALID [2022-04-27 10:43:07,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {8681#true} call ULTIMATE.init(); {8681#true} is VALID [2022-04-27 10:43:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:43:07,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550521810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:43:07,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:43:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 10:43:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411663496] [2022-04-27 10:43:07,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:43:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-27 10:43:07,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:43:07,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:43:08,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:43:08,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 10:43:08,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:43:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 10:43:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1507, Invalid=7999, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 10:43:08,072 INFO L87 Difference]: Start difference. First operand 257 states and 259 transitions. Second operand has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,221 INFO L93 Difference]: Finished difference Result 270 states and 275 transitions. [2022-04-27 10:45:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-04-27 10:45:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2022-04-27 10:45:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 212 transitions. [2022-04-27 10:45:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 212 transitions. [2022-04-27 10:45:22,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 212 transitions. [2022-04-27 10:45:22,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:22,468 INFO L225 Difference]: With dead ends: 270 [2022-04-27 10:45:22,469 INFO L226 Difference]: Without dead ends: 265 [2022-04-27 10:45:22,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6581 ImplicationChecksByTransitivity, 127.3s TimeCoverageRelationStatistics Valid=6662, Invalid=30010, Unknown=0, NotChecked=0, Total=36672 [2022-04-27 10:45:22,476 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 6186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:22,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 283 Invalid, 6186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 4953 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-27 10:45:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-27 10:45:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-04-27 10:45:22,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:22,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,800 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,800 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,803 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2022-04-27 10:45:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2022-04-27 10:45:22,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:22,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:22,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 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 265 states. [2022-04-27 10:45:22,804 INFO L87 Difference]: Start difference. First operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 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 265 states. [2022-04-27 10:45:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:22,807 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2022-04-27 10:45:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2022-04-27 10:45:22,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:22,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:22,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:22,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.0115384615384615) internal successors, (263), 260 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2022-04-27 10:45:22,812 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 103 [2022-04-27 10:45:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:22,812 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2022-04-27 10:45:22,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.0) internal successors, (196), 97 states have internal predecessors, (196), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2022-04-27 10:45:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-27 10:45:22,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:22,813 INFO L195 NwaCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:22,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 10:45:23,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 10:45:23,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:45:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash -486189394, now seen corresponding path program 6 times [2022-04-27 10:45:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:23,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615294042] [2022-04-27 10:45:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:45:23,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:45:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:45:23,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:45:23,148 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:45:23,148 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:45:23,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:45:23,151 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 2, 1, 1] [2022-04-27 10:45:23,154 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:45:23,189 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:45:23,189 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:45:23,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:45:23 BoogieIcfgContainer [2022-04-27 10:45:23,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:45:23,191 INFO L158 Benchmark]: Toolchain (without parser) took 832703.87ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 131.4MB in the beginning and 220.2MB in the end (delta: -88.8MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. [2022-04-27 10:45:23,191 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 184.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:45:23,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.49ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 131.1MB in the beginning and 234.5MB in the end (delta: -103.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-04-27 10:45:23,192 INFO L158 Benchmark]: Boogie Preprocessor took 31.87ms. Allocated memory is still 257.9MB. Free memory was 234.5MB in the beginning and 232.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:45:23,192 INFO L158 Benchmark]: RCFGBuilder took 178.85ms. Allocated memory is still 257.9MB. Free memory was 232.9MB in the beginning and 221.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:45:23,192 INFO L158 Benchmark]: TraceAbstraction took 832309.66ms. Allocated memory is still 257.9MB. Free memory was 221.4MB in the beginning and 220.2MB in the end (delta: 1.2MB). Peak memory consumption was 146.9MB. Max. memory is 8.0GB. [2022-04-27 10:45:23,193 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.08ms. Allocated memory is still 184.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.49ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 131.1MB in the beginning and 234.5MB in the end (delta: -103.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.87ms. Allocated memory is still 257.9MB. Free memory was 234.5MB in the beginning and 232.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 178.85ms. Allocated memory is still 257.9MB. Free memory was 232.9MB in the beginning and 221.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 832309.66ms. Allocated memory is still 257.9MB. Free memory was 221.4MB in the beginning and 220.2MB in the end (delta: 1.2MB). Peak memory consumption was 146.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 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] unsigned int x = 0; [L15] unsigned int y = __VERIFIER_nondet_uint(); [L17] COND TRUE x < 99 VAL [x=0, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=2, y=4294967295] [L17] COND TRUE x < 99 VAL [x=2, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=4, y=4294967295] [L17] COND TRUE x < 99 VAL [x=4, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=6, y=4294967295] [L17] COND TRUE x < 99 VAL [x=6, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=8, y=4294967295] [L17] COND TRUE x < 99 VAL [x=8, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=10, y=4294967295] [L17] COND TRUE x < 99 VAL [x=10, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=12, y=4294967295] [L17] COND TRUE x < 99 VAL [x=12, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=14, y=4294967295] [L17] COND TRUE x < 99 VAL [x=14, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=16, y=4294967295] [L17] COND TRUE x < 99 VAL [x=16, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=18, y=4294967295] [L17] COND TRUE x < 99 VAL [x=18, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=20, y=4294967295] [L17] COND TRUE x < 99 VAL [x=20, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=22, y=4294967295] [L17] COND TRUE x < 99 VAL [x=22, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=24, y=4294967295] [L17] COND TRUE x < 99 VAL [x=24, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=26, y=4294967295] [L17] COND TRUE x < 99 VAL [x=26, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=28, y=4294967295] [L17] COND TRUE x < 99 VAL [x=28, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=30, y=4294967295] [L17] COND TRUE x < 99 VAL [x=30, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=32, y=4294967295] [L17] COND TRUE x < 99 VAL [x=32, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=34, y=4294967295] [L17] COND TRUE x < 99 VAL [x=34, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=36, y=4294967295] [L17] COND TRUE x < 99 VAL [x=36, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=38, y=4294967295] [L17] COND TRUE x < 99 VAL [x=38, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=40, y=4294967295] [L17] COND TRUE x < 99 VAL [x=40, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=42, y=4294967295] [L17] COND TRUE x < 99 VAL [x=42, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=44, y=4294967295] [L17] COND TRUE x < 99 VAL [x=44, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=46, y=4294967295] [L17] COND TRUE x < 99 VAL [x=46, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=48, y=4294967295] [L17] COND TRUE x < 99 VAL [x=48, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=50, y=4294967295] [L17] COND TRUE x < 99 VAL [x=50, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=52, y=4294967295] [L17] COND TRUE x < 99 VAL [x=52, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=54, y=4294967295] [L17] COND TRUE x < 99 VAL [x=54, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=56, y=4294967295] [L17] COND TRUE x < 99 VAL [x=56, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=58, y=4294967295] [L17] COND TRUE x < 99 VAL [x=58, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=60, y=4294967295] [L17] COND TRUE x < 99 VAL [x=60, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=62, y=4294967295] [L17] COND TRUE x < 99 VAL [x=62, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=64, y=4294967295] [L17] COND TRUE x < 99 VAL [x=64, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=66, y=4294967295] [L17] COND TRUE x < 99 VAL [x=66, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=68, y=4294967295] [L17] COND TRUE x < 99 VAL [x=68, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=70, y=4294967295] [L17] COND TRUE x < 99 VAL [x=70, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=72, y=4294967295] [L17] COND TRUE x < 99 VAL [x=72, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=74, y=4294967295] [L17] COND TRUE x < 99 VAL [x=74, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=76, y=4294967295] [L17] COND TRUE x < 99 VAL [x=76, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=78, y=4294967295] [L17] COND TRUE x < 99 VAL [x=78, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=80, y=4294967295] [L17] COND TRUE x < 99 VAL [x=80, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=82, y=4294967295] [L17] COND TRUE x < 99 VAL [x=82, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=84, y=4294967295] [L17] COND TRUE x < 99 VAL [x=84, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=86, y=4294967295] [L17] COND TRUE x < 99 VAL [x=86, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=88, y=4294967295] [L17] COND TRUE x < 99 VAL [x=88, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=90, y=4294967295] [L17] COND TRUE x < 99 VAL [x=90, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=92, y=4294967295] [L17] COND TRUE x < 99 VAL [x=92, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=94, y=4294967295] [L17] COND TRUE x < 99 VAL [x=94, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=96, y=4294967295] [L17] COND TRUE x < 99 VAL [x=96, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=98, y=4294967295] [L17] COND TRUE x < 99 VAL [x=98, y=4294967295] [L18] COND FALSE !(y % 2 == 0) [L21] x += 2 VAL [x=100, y=4294967295] [L17] COND FALSE !(x < 99) VAL [x=100, y=4294967295] [L25] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 832.2s, OverallIterations: 14, TraceHistogramMax: 50, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 741.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 544 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 3047 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13527 IncrementalHoareTripleChecker+Invalid, 16574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3047 mSolverCounterUnsat, 162 mSDtfsCounter, 13527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 691 SyntacticMatches, 8 SemanticMatches, 707 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13842 ImplicationChecksByTransitivity, 718.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=13, InterpolantAutomatonStates: 380, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 192 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 70.0s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 1037 NumberOfCodeBlocks, 1037 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 7397 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 379/14314 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 10:45:23,227 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...