/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:49:54,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:49:54,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:49:54,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:49:54,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:49:54,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:49:54,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:49:54,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:49:54,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:49:54,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:49:54,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:49:54,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:49:54,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:49:54,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:49:54,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:49:54,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:49:54,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:49:54,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:49:54,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:49:54,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:49:54,909 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:49:54,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:49:54,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:49:54,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:49:54,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:49:54,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:49:54,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:49:54,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:49:54,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:49:54,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:49:54,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:49:54,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:49:54,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:49:54,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:49:54,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:49:54,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:49:54,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:49:54,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:49:54,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:49:54,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:49:54,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:49:54,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:49:54,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:49:54,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:49:54,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:49:54,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:49:54,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:49:54,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:49:54,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:49:54,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:49:54,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:49:54,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:49:54,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:49:54,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:49:54,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:49:54,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:49:54,948 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:49:54,948 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:49:54,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:49:54,950 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:49:54,950 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:49:55,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:49:55,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:49:55,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:49:55,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:49:55,137 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:49:55,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-15 12:49:55,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e14a6b1/dd9b09e3e0684e9f80685ced524fee8a/FLAGf8f74d00c [2022-04-15 12:49:55,538 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:49:55,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-15 12:49:55,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e14a6b1/dd9b09e3e0684e9f80685ced524fee8a/FLAGf8f74d00c [2022-04-15 12:49:55,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e14a6b1/dd9b09e3e0684e9f80685ced524fee8a [2022-04-15 12:49:55,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:49:55,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:49:55,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:49:55,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:49:55,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:49:55,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:55" (1/1) ... [2022-04-15 12:49:55,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48615b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:55, skipping insertion in model container [2022-04-15 12:49:55,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:55" (1/1) ... [2022-04-15 12:49:55,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:49:56,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:49:56,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-15 12:49:56,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:49:56,129 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:49:56,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c[368,381] [2022-04-15 12:49:56,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:49:56,149 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:49:56,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56 WrapperNode [2022-04-15 12:49:56,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:49:56,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:49:56,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:49:56,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:49:56,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:49:56,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:49:56,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:49:56,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:49:56,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (1/1) ... [2022-04-15 12:49:56,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:49:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:56,241 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-15 12:49:56,258 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-15 12:49:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:49:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:49:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:49:56,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:49:56,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:49:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:49:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:49:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:49:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:49:56,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:49:56,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:49:56,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:49:56,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:49:56,326 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:49:56,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:49:56,509 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:49:56,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:49:56,514 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 12:49:56,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:56 BoogieIcfgContainer [2022-04-15 12:49:56,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:49:56,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:49:56,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:49:56,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:49:56,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:49:55" (1/3) ... [2022-04-15 12:49:56,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac8d8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:56, skipping insertion in model container [2022-04-15 12:49:56,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:56" (2/3) ... [2022-04-15 12:49:56,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac8d8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:56, skipping insertion in model container [2022-04-15 12:49:56,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:56" (3/3) ... [2022-04-15 12:49:56,521 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-04-15 12:49:56,524 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:49:56,525 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:49:56,560 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:49:56,564 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:49:56,564 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:49:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-15 12:49:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:49:56,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:56,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:56,582 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-15 12:49:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525108640] [2022-04-15 12:49:56,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:49:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-15 12:49:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:56,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320703238] [2022-04-15 12:49:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:56,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:49:56,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:49:56,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 12:49:56,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:56,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-15 12:49:56,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:49:56,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-15 12:49:56,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-15 12:49:56,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-15 12:49:56,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:56,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-15 12:49:56,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:56,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-15 12:49:56,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 12:49:56,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 12:49:56,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 12:49:56,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 12:49:56,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 12:49:56,755 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-15 12:49:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:56,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320703238] [2022-04-15 12:49:56,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320703238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:56,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:56,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:49:56,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525108640] [2022-04-15 12:49:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525108640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:56,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:49:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830395695] [2022-04-15 12:49:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:56,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-15 12:49:56,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:56,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:56,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:49:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:49:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:49:56,801 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:56,902 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 12:49:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:49:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-15 12:49:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:49:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:49:56,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 12:49:56,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:56,966 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:49:56,966 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:49:56,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:49:56,970 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-15 12:49:56,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:49:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:49:56,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:56,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,992 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,992 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:56,994 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 12:49:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:56,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:56,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:56,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:49:56,995 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:49:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:56,996 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-15 12:49:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:56,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:56,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:56,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-15 12:49:56,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-15 12:49:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:56,999 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-15 12:49:56,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-15 12:49:57,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-15 12:49:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:49:57,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:57,018 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:57,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:49:57,018 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-15 12:49:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:57,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100843764] [2022-04-15 12:49:57,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:49:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-15 12:49:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:57,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726318348] [2022-04-15 12:49:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:57,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 12:49:57,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 12:49:57,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 12:49:57,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:57,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-15 12:49:57,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-15 12:49:57,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-15 12:49:57,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-15 12:49:57,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:49:57,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:57,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-15 12:49:57,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:57,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:57,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:57,391 INFO L272 TraceCheckUtils]: 11: Hoare triple {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:57,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:57,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-15 12:49:57,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-15 12:49:57,392 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-15 12:49:57,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:57,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726318348] [2022-04-15 12:49:57,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726318348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:57,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:57,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:57,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:57,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100843764] [2022-04-15 12:49:57,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100843764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:57,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:57,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:57,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072216173] [2022-04-15 12:49:57,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-15 12:49:57,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:57,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:57,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:49:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:49:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:49:57,412 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:57,805 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-15 12:49:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:49:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 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 15 [2022-04-15 12:49:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 12:49:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 12:49:57,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 12:49:57,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:57,866 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:49:57,866 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:49:57,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:49:57,867 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:57,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:49:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 12:49:57,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:57,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,877 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,877 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:57,878 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:49:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:49:57,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:57,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:57,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:57,879 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:57,881 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:49:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:49:57,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:57,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:57,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:57,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 12:49:57,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-15 12:49:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:57,883 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 12:49:57,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-15 12:49:57,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 12:49:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:49:57,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:57,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:57,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:49:57,906 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-04-15 12:49:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:57,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409673588] [2022-04-15 12:49:57,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:49:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 2 times [2022-04-15 12:49:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769548992] [2022-04-15 12:49:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:57,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 12:49:57,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 12:49:57,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 12:49:57,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:57,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-15 12:49:57,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-15 12:49:57,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-15 12:49:57,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-15 12:49:57,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-15 12:49:57,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-15 12:49:57,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(= main_~y~0 0)} ~z~0 := ~y~0; {362#(= main_~y~0 0)} is VALID [2022-04-15 12:49:57,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID [2022-04-15 12:49:57,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {358#false} is VALID [2022-04-15 12:49:57,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-15 12:49:57,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-15 12:49:57,946 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-15 12:49:57,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-15 12:49:57,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-15 12:49:57,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-15 12:49:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769548992] [2022-04-15 12:49:57,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769548992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:57,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:57,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:57,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409673588] [2022-04-15 12:49:57,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409673588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:57,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:57,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319477411] [2022-04-15 12:49:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:57,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:57,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:57,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:57,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:49:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:57,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:49:57,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:49:57,959 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:58,035 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 12:49:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:49:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 12:49:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 12:49:58,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 12:49:58,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:58,067 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:49:58,068 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:49:58,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:49:58,069 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:58,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:49:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:49:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-15 12:49:58,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:58,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,087 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,087 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:58,093 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:49:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:49:58,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:58,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:58,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:58,095 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:49:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:58,096 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 12:49:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 12:49:58,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:58,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:58,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:58,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 12:49:58,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2022-04-15 12:49:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:58,099 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 12:49:58,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 12:49:58,120 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-15 12:49:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 12:49:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:49:58,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:58,122 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:58,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:49:58,124 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times [2022-04-15 12:49:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:58,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515030325] [2022-04-15 12:49:58,283 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1734323905, now seen corresponding path program 1 times [2022-04-15 12:49:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:58,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255502694] [2022-04-15 12:49:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:58,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(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(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-15 12:49:58,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-15 12:49:58,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-15 12:49:58,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {533#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:58,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#(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(10, 2);call #Ultimate.allocInit(12, 3); {522#true} is VALID [2022-04-15 12:49:58,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2022-04-15 12:49:58,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #72#return; {522#true} is VALID [2022-04-15 12:49:58,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret13 := main(); {522#true} is VALID [2022-04-15 12:49:58,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 12:49:58,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:58,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:49:58,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [76] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-15 12:49:58,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#(< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1))} [75] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:58,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:58,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:58,433 INFO L272 TraceCheckUtils]: 12: Hoare triple {530#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {531#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:58,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {532#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:58,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {523#false} is VALID [2022-04-15 12:49:58,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#false} assume !false; {523#false} is VALID [2022-04-15 12:49:58,434 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-15 12:49:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:58,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255502694] [2022-04-15 12:49:58,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255502694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:58,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:58,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:49:58,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515030325] [2022-04-15 12:49:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515030325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:58,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:58,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:49:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752290621] [2022-04-15 12:49:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:58,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:58,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:58,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:58,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:49:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:49:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:49:58,595 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:59,048 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 12:49:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:49:59,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 12:49:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 12:49:59,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-15 12:49:59,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:59,115 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:49:59,115 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:49:59,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:49:59,116 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:59,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:49:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:49:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:49:59,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:59,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,127 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,127 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:59,128 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:49:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:59,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:59,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:59,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:49:59,129 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:49:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:59,130 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:49:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:59,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:59,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:59,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:59,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 12:49:59,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2022-04-15 12:49:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:59,131 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 12:49:59,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 12:49:59,156 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-15 12:49:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:49:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:49:59,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:59,157 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:59,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:49:59,157 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-15 12:49:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:59,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445645319] [2022-04-15 12:49:59,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1936464066, now seen corresponding path program 1 times [2022-04-15 12:49:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:59,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757698592] [2022-04-15 12:49:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:59,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {705#(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(10, 2);call #Ultimate.allocInit(12, 3); {692#true} is VALID [2022-04-15 12:49:59,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#true} assume true; {692#true} is VALID [2022-04-15 12:49:59,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {692#true} {692#true} #72#return; {692#true} is VALID [2022-04-15 12:49:59,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:59,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#(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(10, 2);call #Ultimate.allocInit(12, 3); {692#true} is VALID [2022-04-15 12:49:59,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2022-04-15 12:49:59,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #72#return; {692#true} is VALID [2022-04-15 12:49:59,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret13 := main(); {692#true} is VALID [2022-04-15 12:49:59,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {697#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:49:59,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {697#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [78] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2)) (and (= 0 |v_main_#t~post6_Out_2|) (<= v_main_~x~0_Out_4 v_main_~x~0_In_2) (< 0 (mod (+ v_main_~x~0_Out_4 1) 4294967296)) (= |v_main_#t~post5_Out_2| 0) (= (+ v_main_~x~0_Out_4 v_main_~y~0_Out_2) (+ v_main_~x~0_In_2 v_main_~y~0_In_1)))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_4, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {698#(or (and (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (= main_~n~0 main_~x~0))} is VALID [2022-04-15 12:49:59,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#(or (and (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (= main_~n~0 main_~x~0))} [77] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {699#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:49:59,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {700#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-15 12:49:59,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {700#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {701#(and (or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* main_~y~0 2) (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:59,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#(and (or (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (and (<= (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* main_~y~0 2) (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ (* 2 (div main_~x~0 4294967296)) (* (div main_~y~0 4294967296) 2)) (div (* main_~n~0 2) 4294967296)))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {702#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:59,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {702#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {702#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:59,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {702#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:59,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {703#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {704#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:59,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {693#false} is VALID [2022-04-15 12:49:59,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {693#false} assume !false; {693#false} is VALID [2022-04-15 12:49:59,700 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-15 12:49:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:59,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757698592] [2022-04-15 12:49:59,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757698592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:59,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:59,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:49:59,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445645319] [2022-04-15 12:49:59,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445645319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:59,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:59,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:49:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914629802] [2022-04-15 12:49:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:59,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:49:59,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:59,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:59,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:59,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:49:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:49:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:49:59,804 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:00,821 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-15 12:50:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:50:00,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:50:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-15 12:50:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-15 12:50:00,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2022-04-15 12:50:00,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:00,887 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:50:00,887 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:50:00,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:50:00,888 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:00,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 48 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:50:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:50:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-04-15 12:50:00,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:00,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,941 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,941 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:00,943 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 12:50:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 12:50:00,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:00,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:00,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:50:00,943 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:50:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:00,944 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 12:50:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 12:50:00,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:00,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:00,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:00,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-04-15 12:50:00,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2022-04-15 12:50:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:00,946 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-04-15 12:50:00,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:00,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 34 transitions. [2022-04-15 12:50:00,998 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-15 12:50:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-04-15 12:50:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:50:00,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:00,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:00,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:50:00,999 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-15 12:50:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:01,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644139561] [2022-04-15 12:50:01,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2000352087, now seen corresponding path program 1 times [2022-04-15 12:50:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:01,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733177337] [2022-04-15 12:50:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:01,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {944#(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(10, 2);call #Ultimate.allocInit(12, 3); {934#true} is VALID [2022-04-15 12:50:01,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-15 12:50:01,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {934#true} {934#true} #72#return; {934#true} is VALID [2022-04-15 12:50:01,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:01,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {944#(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(10, 2);call #Ultimate.allocInit(12, 3); {934#true} is VALID [2022-04-15 12:50:01,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {934#true} assume true; {934#true} is VALID [2022-04-15 12:50:01,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {934#true} {934#true} #72#return; {934#true} is VALID [2022-04-15 12:50:01,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {934#true} call #t~ret13 := main(); {934#true} is VALID [2022-04-15 12:50:01,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {939#(= main_~y~0 0)} is VALID [2022-04-15 12:50:01,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {940#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:01,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {941#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:50:01,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [80] L23-2-->L29-1_primed: Formula: (or (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (= (+ v_main_~z~0_In_2 v_main_~x~0_In_3) (+ v_main_~x~0_Out_6 v_main_~z~0_Out_4)) (= |v_main_#t~post7_Out_4| 0) (= |v_main_#t~post8_Out_4| 0) (<= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~z~0_In_2 v_main_~z~0_Out_4))) InVars {main_~x~0=v_main_~x~0_In_3, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_6, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {942#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:50:01,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {942#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [79] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {943#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:01,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {943#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {943#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:01,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {935#false} is VALID [2022-04-15 12:50:01,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {935#false} assume !(~x~0 % 4294967296 > 0); {935#false} is VALID [2022-04-15 12:50:01,335 INFO L272 TraceCheckUtils]: 13: Hoare triple {935#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {935#false} is VALID [2022-04-15 12:50:01,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {935#false} ~cond := #in~cond; {935#false} is VALID [2022-04-15 12:50:01,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {935#false} assume 0 == ~cond; {935#false} is VALID [2022-04-15 12:50:01,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#false} assume !false; {935#false} is VALID [2022-04-15 12:50:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733177337] [2022-04-15 12:50:01,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733177337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:01,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:01,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:50:01,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644139561] [2022-04-15 12:50:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644139561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:50:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884001307] [2022-04-15 12:50:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:01,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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 17 [2022-04-15 12:50:01,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:01,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-15 12:50:01,596 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-15 12:50:01,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:50:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:50:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:50:01,597 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-15 12:50:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,785 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-15 12:50:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:50:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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 17 [2022-04-15 12:50:01,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-15 12:50:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 12:50:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-15 12:50:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-15 12:50:01,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-15 12:50:01,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:01,827 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:50:01,828 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:50:01,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:50:01,828 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:01,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-04-15 12:50:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:50:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 12:50:01,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:01,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,869 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,869 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,870 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 12:50:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:50:01,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:01,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:01,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 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 30 states. [2022-04-15 12:50:01,871 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 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 30 states. [2022-04-15 12:50:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,872 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 12:50:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 12:50:01,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:01,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:01,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:01,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-04-15 12:50:01,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 17 [2022-04-15 12:50:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:01,873 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-04-15 12:50:01,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-15 12:50:01,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 38 transitions. [2022-04-15 12:50:01,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-15 12:50:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:50:01,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:01,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:01,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:50:01,928 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-04-15 12:50:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:01,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892594763] [2022-04-15 12:50:02,068 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1954242533, now seen corresponding path program 1 times [2022-04-15 12:50:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:02,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170699057] [2022-04-15 12:50:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#(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(10, 2);call #Ultimate.allocInit(12, 3); {1151#true} is VALID [2022-04-15 12:50:02,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {1151#true} assume true; {1151#true} is VALID [2022-04-15 12:50:02,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1151#true} {1151#true} #72#return; {1151#true} is VALID [2022-04-15 12:50:02,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {1151#true} call ULTIMATE.init(); {1158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:02,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#(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(10, 2);call #Ultimate.allocInit(12, 3); {1151#true} is VALID [2022-04-15 12:50:02,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1151#true} assume true; {1151#true} is VALID [2022-04-15 12:50:02,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1151#true} {1151#true} #72#return; {1151#true} is VALID [2022-04-15 12:50:02,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {1151#true} call #t~ret13 := main(); {1151#true} is VALID [2022-04-15 12:50:02,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {1151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1151#true} is VALID [2022-04-15 12:50:02,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1151#true} [82] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1151#true} is VALID [2022-04-15 12:50:02,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#true} [81] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-15 12:50:02,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#true} ~z~0 := ~y~0; {1156#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:50:02,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1157#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:02,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {1157#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1152#false} is VALID [2022-04-15 12:50:02,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {1152#false} assume !(~y~0 % 4294967296 > 0); {1152#false} is VALID [2022-04-15 12:50:02,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#false} assume !(~x~0 % 4294967296 > 0); {1152#false} is VALID [2022-04-15 12:50:02,156 INFO L272 TraceCheckUtils]: 13: Hoare triple {1152#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1152#false} is VALID [2022-04-15 12:50:02,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#false} ~cond := #in~cond; {1152#false} is VALID [2022-04-15 12:50:02,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#false} assume 0 == ~cond; {1152#false} is VALID [2022-04-15 12:50:02,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {1152#false} assume !false; {1152#false} is VALID [2022-04-15 12:50:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:02,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170699057] [2022-04-15 12:50:02,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170699057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:02,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:02,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:50:02,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:02,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892594763] [2022-04-15 12:50:02,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892594763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:02,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:02,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:50:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284599091] [2022-04-15 12:50:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:02,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 17 [2022-04-15 12:50:02,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:02,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-15 12:50:02,187 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-15 12:50:02,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:50:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:50:02,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:50:02,188 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-15 12:50:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,360 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 12:50:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:50:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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 17 [2022-04-15 12:50:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-15 12:50:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:50:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-15 12:50:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-15 12:50:02,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-15 12:50:02,385 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-15 12:50:02,386 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:50:02,386 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:50:02,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:50:02,387 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:02,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:50:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:50:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 12:50:02,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:02,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:02,420 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:02,420 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,421 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 12:50:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 12:50:02,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:02,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:02,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:50:02,421 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:50:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,422 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 12:50:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 12:50:02,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:02,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:02,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:02,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-04-15 12:50:02,423 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2022-04-15 12:50:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:02,423 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-04-15 12:50:02,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-15 12:50:02,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 33 transitions. [2022-04-15 12:50:02,485 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-15 12:50:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-15 12:50:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:50:02,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:02,485 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:02,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:50:02,486 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash 17779232, now seen corresponding path program 2 times [2022-04-15 12:50:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:02,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724981163] [2022-04-15 12:50:02,581 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1741775575, now seen corresponding path program 1 times [2022-04-15 12:50:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:02,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692018460] [2022-04-15 12:50:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {1355#(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(10, 2);call #Ultimate.allocInit(12, 3); {1345#true} is VALID [2022-04-15 12:50:02,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-04-15 12:50:02,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1345#true} {1345#true} #72#return; {1345#true} is VALID [2022-04-15 12:50:02,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1355#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:02,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1355#(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(10, 2);call #Ultimate.allocInit(12, 3); {1345#true} is VALID [2022-04-15 12:50:02,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-04-15 12:50:02,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #72#return; {1345#true} is VALID [2022-04-15 12:50:02,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret13 := main(); {1345#true} is VALID [2022-04-15 12:50:02,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {1345#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1350#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:50:02,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {1350#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {1351#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:02,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {1351#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1352#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:50:02,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {1352#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [84] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~z~0_In_3 v_main_~z~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (= |v_main_#t~post8_Out_6| 0) (<= v_main_~x~0_In_5 v_main_~x~0_Out_10) (= |v_main_#t~post7_Out_6| 0) (< 0 (mod (+ v_main_~z~0_Out_6 1) 4294967296)) (= (+ v_main_~z~0_In_3 v_main_~x~0_In_5) (+ v_main_~z~0_Out_6 v_main_~x~0_Out_10)))) InVars {main_~x~0=v_main_~x~0_In_5, main_~z~0=v_main_~z~0_In_3} OutVars{main_~x~0=v_main_~x~0_Out_10, main_#t~post8=|v_main_#t~post8_Out_6|, main_~z~0=v_main_~z~0_Out_6, main_#t~post7=|v_main_#t~post7_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1353#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:50:02,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1353#(or (<= (+ 4294967296 (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [83] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:02,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {1354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:02,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1346#false} is VALID [2022-04-15 12:50:02,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#false} assume !(~x~0 % 4294967296 > 0); {1346#false} is VALID [2022-04-15 12:50:02,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {1346#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1346#false} is VALID [2022-04-15 12:50:02,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2022-04-15 12:50:02,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1346#false} assume 0 == ~cond; {1346#false} is VALID [2022-04-15 12:50:02,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2022-04-15 12:50:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692018460] [2022-04-15 12:50:02,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692018460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:02,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:02,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:50:02,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:02,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724981163] [2022-04-15 12:50:02,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724981163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:02,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:02,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:50:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459143690] [2022-04-15 12:50:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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 18 [2022-04-15 12:50:02,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:02,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-15 12:50:02,944 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-15 12:50:02,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:50:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:50:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:50:02,946 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-15 12:50:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:03,197 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 12:50:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:50:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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 18 [2022-04-15 12:50:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-15 12:50:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:50:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-15 12:50:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:50:03,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:50:03,224 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-15 12:50:03,225 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:50:03,225 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:50:03,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:50:03,226 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:03,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 42 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:50:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:50:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:50:03,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:03,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:03,250 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:03,250 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:03,251 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-15 12:50:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 12:50:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:03,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:03,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 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 21 states. [2022-04-15 12:50:03,251 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 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 21 states. [2022-04-15 12:50:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:03,252 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-15 12:50:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 12:50:03,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:03,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:03,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:03,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 12:50:03,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 18 [2022-04-15 12:50:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:03,253 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 12:50:03,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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-15 12:50:03,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 12:50:03,290 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-15 12:50:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 12:50:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:50:03,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:03,291 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:03,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:50:03,291 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash -58627519, now seen corresponding path program 1 times [2022-04-15 12:50:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:03,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1830687283] [2022-04-15 12:50:03,434 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1903292002, now seen corresponding path program 1 times [2022-04-15 12:50:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:03,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397823713] [2022-04-15 12:50:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:03,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {1526#(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(10, 2);call #Ultimate.allocInit(12, 3); {1519#true} is VALID [2022-04-15 12:50:03,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1519#true} assume true; {1519#true} is VALID [2022-04-15 12:50:03,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1519#true} {1519#true} #72#return; {1519#true} is VALID [2022-04-15 12:50:03,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {1519#true} call ULTIMATE.init(); {1526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:03,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#(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(10, 2);call #Ultimate.allocInit(12, 3); {1519#true} is VALID [2022-04-15 12:50:03,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1519#true} assume true; {1519#true} is VALID [2022-04-15 12:50:03,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1519#true} {1519#true} #72#return; {1519#true} is VALID [2022-04-15 12:50:03,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {1519#true} call #t~ret13 := main(); {1519#true} is VALID [2022-04-15 12:50:03,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {1519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1519#true} is VALID [2022-04-15 12:50:03,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#true} [86] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_6 v_main_~x~0_Out_12)) (and (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_3) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_6)) (= 0 |v_main_#t~post6_Out_6|) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1519#true} is VALID [2022-04-15 12:50:03,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1519#true} is VALID [2022-04-15 12:50:03,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#true} ~z~0 := ~y~0; {1524#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:50:03,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:03,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:03,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1520#false} is VALID [2022-04-15 12:50:03,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {1520#false} assume !(~x~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,478 INFO L272 TraceCheckUtils]: 14: Hoare triple {1520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1520#false} is VALID [2022-04-15 12:50:03,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {1520#false} ~cond := #in~cond; {1520#false} is VALID [2022-04-15 12:50:03,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#false} assume 0 == ~cond; {1520#false} is VALID [2022-04-15 12:50:03,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1520#false} assume !false; {1520#false} is VALID [2022-04-15 12:50:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397823713] [2022-04-15 12:50:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397823713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:03,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392263167] [2022-04-15 12:50:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:03,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:03,496 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-15 12:50:03,499 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-15 12:50:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:03,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:50:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:03,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:03,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {1519#true} call ULTIMATE.init(); {1519#true} is VALID [2022-04-15 12:50:03,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {1519#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(10, 2);call #Ultimate.allocInit(12, 3); {1519#true} is VALID [2022-04-15 12:50:03,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {1519#true} assume true; {1519#true} is VALID [2022-04-15 12:50:03,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1519#true} {1519#true} #72#return; {1519#true} is VALID [2022-04-15 12:50:03,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {1519#true} call #t~ret13 := main(); {1519#true} is VALID [2022-04-15 12:50:03,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {1519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1519#true} is VALID [2022-04-15 12:50:03,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#true} [86] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_6 v_main_~x~0_Out_12)) (and (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_3) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_6)) (= 0 |v_main_#t~post6_Out_6|) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1519#true} is VALID [2022-04-15 12:50:03,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1519#true} is VALID [2022-04-15 12:50:03,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#true} ~z~0 := ~y~0; {1524#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:50:03,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1557#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} is VALID [2022-04-15 12:50:03,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {1557#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} assume !(~z~0 % 4294967296 > 0); {1557#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0))} assume !(~y~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {1520#false} assume !(~x~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L272 TraceCheckUtils]: 14: Hoare triple {1520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {1520#false} ~cond := #in~cond; {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#false} assume 0 == ~cond; {1520#false} is VALID [2022-04-15 12:50:03,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {1520#false} assume !false; {1520#false} is VALID [2022-04-15 12:50:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:03,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:03,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {1520#false} assume !false; {1520#false} is VALID [2022-04-15 12:50:03,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {1520#false} assume 0 == ~cond; {1520#false} is VALID [2022-04-15 12:50:03,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {1520#false} ~cond := #in~cond; {1520#false} is VALID [2022-04-15 12:50:03,925 INFO L272 TraceCheckUtils]: 14: Hoare triple {1520#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1520#false} is VALID [2022-04-15 12:50:03,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {1520#false} assume !(~x~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {1520#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1520#false} is VALID [2022-04-15 12:50:03,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1520#false} is VALID [2022-04-15 12:50:03,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:03,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1525#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:03,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#true} ~z~0 := ~y~0; {1606#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:50:03,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {1519#true} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1519#true} is VALID [2022-04-15 12:50:03,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {1519#true} [86] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_6 v_main_~x~0_Out_12)) (and (= |v_main_#t~post5_Out_6| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_3) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_6)) (= 0 |v_main_#t~post6_Out_6|) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1519#true} is VALID [2022-04-15 12:50:03,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {1519#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1519#true} is VALID [2022-04-15 12:50:03,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {1519#true} call #t~ret13 := main(); {1519#true} is VALID [2022-04-15 12:50:03,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1519#true} {1519#true} #72#return; {1519#true} is VALID [2022-04-15 12:50:03,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1519#true} assume true; {1519#true} is VALID [2022-04-15 12:50:03,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {1519#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(10, 2);call #Ultimate.allocInit(12, 3); {1519#true} is VALID [2022-04-15 12:50:03,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {1519#true} call ULTIMATE.init(); {1519#true} is VALID [2022-04-15 12:50:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:03,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392263167] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:03,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:50:03,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2022-04-15 12:50:03,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1830687283] [2022-04-15 12:50:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1830687283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:50:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303623290] [2022-04-15 12:50:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:03,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 18 [2022-04-15 12:50:03,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:03,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:03,970 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-15 12:50:03,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:50:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:50:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:50:03,971 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:04,059 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 12:50:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:50:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 18 [2022-04-15 12:50:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:50:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 12:50:04,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 12:50:04,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:04,082 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:50:04,082 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:50:04,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:50:04,083 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:04,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:50:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:50:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-15 12:50:04,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:04,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,117 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,117 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:04,118 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:50:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:50:04,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:04,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:04,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:50:04,118 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:50:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:04,119 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 12:50:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:50:04,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:04,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:04,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:04,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 12:50:04,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 18 [2022-04-15 12:50:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:04,120 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 12:50:04,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:04,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 12:50:04,143 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-15 12:50:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 12:50:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:50:04,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:04,143 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:04,175 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-15 12:50:04,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:04,361 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-15 12:50:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474933992] [2022-04-15 12:50:04,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash -29616879, now seen corresponding path program 1 times [2022-04-15 12:50:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:04,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645975588] [2022-04-15 12:50:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(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(10, 2);call #Ultimate.allocInit(12, 3); {1779#true} is VALID [2022-04-15 12:50:04,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1779#true} assume true; {1779#true} is VALID [2022-04-15 12:50:04,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1779#true} {1779#true} #72#return; {1779#true} is VALID [2022-04-15 12:50:04,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {1779#true} call ULTIMATE.init(); {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:04,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1788#(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(10, 2);call #Ultimate.allocInit(12, 3); {1779#true} is VALID [2022-04-15 12:50:04,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {1779#true} assume true; {1779#true} is VALID [2022-04-15 12:50:04,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1779#true} {1779#true} #72#return; {1779#true} is VALID [2022-04-15 12:50:04,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {1779#true} call #t~ret13 := main(); {1779#true} is VALID [2022-04-15 12:50:04,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1784#(= main_~y~0 0)} is VALID [2022-04-15 12:50:04,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1784#(= main_~y~0 0)} [88] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (= (+ v_main_~x~0_Out_14 v_main_~y~0_Out_8) (+ v_main_~x~0_In_7 v_main_~y~0_In_4)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1785#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:50:04,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1785#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:50:04,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {1786#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:50:04,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:04,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:04,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:04,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:04,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1780#false} is VALID [2022-04-15 12:50:04,627 INFO L272 TraceCheckUtils]: 14: Hoare triple {1780#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1780#false} is VALID [2022-04-15 12:50:04,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#false} ~cond := #in~cond; {1780#false} is VALID [2022-04-15 12:50:04,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {1780#false} assume 0 == ~cond; {1780#false} is VALID [2022-04-15 12:50:04,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#false} assume !false; {1780#false} is VALID [2022-04-15 12:50:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645975588] [2022-04-15 12:50:04,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645975588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550397993] [2022-04-15 12:50:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:04,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:04,629 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-15 12:50:04,647 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-15 12:50:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:50:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:05,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1779#true} call ULTIMATE.init(); {1779#true} is VALID [2022-04-15 12:50:05,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1779#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(10, 2);call #Ultimate.allocInit(12, 3); {1779#true} is VALID [2022-04-15 12:50:05,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {1779#true} assume true; {1779#true} is VALID [2022-04-15 12:50:05,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1779#true} {1779#true} #72#return; {1779#true} is VALID [2022-04-15 12:50:05,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1779#true} call #t~ret13 := main(); {1779#true} is VALID [2022-04-15 12:50:05,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1784#(= main_~y~0 0)} is VALID [2022-04-15 12:50:05,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {1784#(= main_~y~0 0)} [88] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (= (+ v_main_~x~0_Out_14 v_main_~y~0_Out_8) (+ v_main_~x~0_In_7 v_main_~y~0_In_4)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1810#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:05,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1810#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:05,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1817#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:50:05,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {1817#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1821#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} is VALID [2022-04-15 12:50:05,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1821#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} assume !(~z~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1780#false} is VALID [2022-04-15 12:50:05,066 INFO L272 TraceCheckUtils]: 14: Hoare triple {1780#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1780#false} is VALID [2022-04-15 12:50:05,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#false} ~cond := #in~cond; {1780#false} is VALID [2022-04-15 12:50:05,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {1780#false} assume 0 == ~cond; {1780#false} is VALID [2022-04-15 12:50:05,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#false} assume !false; {1780#false} is VALID [2022-04-15 12:50:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:05,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:05,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#false} assume !false; {1780#false} is VALID [2022-04-15 12:50:05,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {1780#false} assume 0 == ~cond; {1780#false} is VALID [2022-04-15 12:50:05,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#false} ~cond := #in~cond; {1780#false} is VALID [2022-04-15 12:50:05,558 INFO L272 TraceCheckUtils]: 14: Hoare triple {1780#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1780#false} is VALID [2022-04-15 12:50:05,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1780#false} is VALID [2022-04-15 12:50:05,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {1867#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {1787#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:50:05,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1871#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1867#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0))} is VALID [2022-04-15 12:50:05,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1875#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} ~z~0 := ~y~0; {1871#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:50:05,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1875#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1875#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:50:05,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {1882#(< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296)))} [88] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (= (+ v_main_~x~0_Out_14 v_main_~y~0_Out_8) (+ v_main_~x~0_In_7 v_main_~y~0_In_4)) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1875#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:50:05,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1882#(< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:50:05,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1779#true} call #t~ret13 := main(); {1779#true} is VALID [2022-04-15 12:50:05,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1779#true} {1779#true} #72#return; {1779#true} is VALID [2022-04-15 12:50:05,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1779#true} assume true; {1779#true} is VALID [2022-04-15 12:50:05,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1779#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(10, 2);call #Ultimate.allocInit(12, 3); {1779#true} is VALID [2022-04-15 12:50:05,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {1779#true} call ULTIMATE.init(); {1779#true} is VALID [2022-04-15 12:50:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:50:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550397993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:05,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:05,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-15 12:50:05,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:05,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474933992] [2022-04-15 12:50:05,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474933992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:05,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:05,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:50:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530088143] [2022-04-15 12:50:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:05,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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 18 [2022-04-15 12:50:05,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:05,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-15 12:50:05,662 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-15 12:50:05,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:50:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:50:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:50:05,663 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-15 12:50:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:05,971 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 12:50:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:50:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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 18 [2022-04-15 12:50:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-15 12:50:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:50:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-15 12:50:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:50:05,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:50:06,009 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-15 12:50:06,011 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:50:06,011 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:50:06,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:50:06,012 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:06,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 35 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:50:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:50:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 12:50:06,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:06,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:06,051 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:06,052 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:06,052 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 12:50:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 12:50:06,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:06,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:06,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:50:06,053 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:50:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:06,054 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 12:50:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 12:50:06,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:06,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:06,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:06,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 12:50:06,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2022-04-15 12:50:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:06,055 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 12:50:06,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 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-15 12:50:06,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 12:50:06,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:50:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:50:06,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:06,091 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:06,107 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-15 12:50:06,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:50:06,292 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-15 12:50:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:06,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [596305521] [2022-04-15 12:50:06,402 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1212268729, now seen corresponding path program 1 times [2022-04-15 12:50:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:06,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113730751] [2022-04-15 12:50:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:06,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {2080#(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(10, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 12:50:06,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 12:50:06,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-15 12:50:06,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:06,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#(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(10, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 12:50:06,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 12:50:06,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-15 12:50:06,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-15 12:50:06,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:06,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [90] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_5)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2071#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 12:50:06,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2072#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:50:06,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {2072#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {2073#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:50:06,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2073#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2074#(<= (+ main_~n~0 (* (div main_~z~0 4294967296) 2147483648)) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) main_~z~0 1))} is VALID [2022-04-15 12:50:06,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#(<= (+ main_~n~0 (* (div main_~z~0 4294967296) 2147483648)) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {2075#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:06,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 12:50:06,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2076#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 12:50:06,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4294967296 (* (- 2) main_~n~0)) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:06,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:06,734 INFO L272 TraceCheckUtils]: 15: Hoare triple {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2078#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:50:06,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {2078#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2079#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:50:06,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {2079#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 12:50:06,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 12:50:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:06,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:06,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113730751] [2022-04-15 12:50:06,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113730751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:06,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999877142] [2022-04-15 12:50:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:06,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:06,737 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-15 12:50:06,738 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-15 12:50:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:06,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:50:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:07,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:26,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 12:50:26,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(10, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 12:50:26,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 12:50:26,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-15 12:50:26,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-15 12:50:26,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:50:26,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [90] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_5)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2102#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:50:26,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2106#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:50:26,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2106#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {2110#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:50:26,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2110#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2114#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:50:26,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {2114#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2118#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:50:26,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {2118#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod main_~z~0 4294967296) 0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2122#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:50:26,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {2122#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !(~y~0 % 4294967296 > 0); {2126#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:50:26,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {2126#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2130#(and (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (<= 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 12:50:26,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {2130#(and (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (<= 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {2130#(and (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (<= 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 12:50:27,017 INFO L272 TraceCheckUtils]: 15: Hoare triple {2130#(and (<= (mod (+ main_~n~0 1 (* main_~z~0 4294967295)) 4294967296) 0) (<= 1 main_~z~0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:27,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:50:27,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 12:50:27,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 12:50:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:27,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:52,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 12:50:52,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 12:50:52,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:50:52,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:52,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:52,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {2163#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2077#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:52,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2167#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2163#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:50:52,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {2171#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2167#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:50:52,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {2175#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {2171#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:50:52,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2175#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:50:52,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {2183#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))))} ~z~0 := ~y~0; {2179#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:50:52,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {2187#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2183#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))))} is VALID [2022-04-15 12:50:54,202 WARN L290 TraceCheckUtils]: 6: Hoare triple {2191#(and (forall ((aux_div_aux_mod_v_main_~y~0_39_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_39_46_102 Int) (aux_div_v_main_~y~0_39_46 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (* aux_div_v_main_~y~0_39_46 4294967296)) (< (* aux_div_v_main_~y~0_39_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_39_46_102) (and (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 1)) (<= (mod (+ main_~y~0 main_~x~0 2 (* 4294967295 aux_mod_aux_mod_v_main_~y~0_39_46_102)) 4294967296) 0) (forall ((aux_div_v_main_~x~0_62_31 Int)) (or (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 main_~x~0 1))))) (or (not (= (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 4294967295))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (* main_~n~0 2)))) (forall ((aux_div_aux_mod_v_main_~y~0_39_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_39_46_102 Int) (aux_div_v_main_~y~0_39_46 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (* aux_div_v_main_~y~0_39_46 4294967296)) (< (* aux_div_v_main_~y~0_39_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102 1)) (and (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 1)) (<= (mod (+ main_~y~0 main_~x~0 2 (* 4294967295 aux_mod_aux_mod_v_main_~y~0_39_46_102)) 4294967296) 0) (forall ((aux_div_v_main_~x~0_62_31 Int)) (or (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 main_~x~0 1))))) (or (not (= (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 4294967295))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< aux_mod_aux_mod_v_main_~y~0_39_46_102 0))))} [90] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= |v_main_#t~post6_Out_10| 0) (= (+ v_main_~y~0_Out_10 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_5)) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8) (= |v_main_#t~post5_Out_10| 0)) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2187#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-15 12:50:54,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2191#(and (forall ((aux_div_aux_mod_v_main_~y~0_39_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_39_46_102 Int) (aux_div_v_main_~y~0_39_46 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (* aux_div_v_main_~y~0_39_46 4294967296)) (< (* aux_div_v_main_~y~0_39_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_39_46_102) (and (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 1)) (<= (mod (+ main_~y~0 main_~x~0 2 (* 4294967295 aux_mod_aux_mod_v_main_~y~0_39_46_102)) 4294967296) 0) (forall ((aux_div_v_main_~x~0_62_31 Int)) (or (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 main_~x~0 1))))) (or (not (= (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 4294967295))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (* main_~n~0 2)))) (forall ((aux_div_aux_mod_v_main_~y~0_39_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_39_46_102 Int) (aux_div_v_main_~y~0_39_46 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (* aux_div_v_main_~y~0_39_46 4294967296)) (< (* aux_div_v_main_~y~0_39_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (* main_~n~0 2) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102 1)) (and (or (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 1)) (<= (mod (+ main_~y~0 main_~x~0 2 (* 4294967295 aux_mod_aux_mod_v_main_~y~0_39_46_102)) 4294967296) 0) (forall ((aux_div_v_main_~x~0_62_31 Int)) (or (< (+ main_~y~0 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102)) (< (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) (* aux_div_v_main_~x~0_62_31 4294967296) aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 main_~x~0 1))))) (or (not (= (+ (* aux_div_aux_mod_v_main_~y~0_39_46_102 4294967296) 4294967294 aux_mod_aux_mod_v_main_~y~0_39_46_102) (+ main_~y~0 4294967295))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< aux_mod_aux_mod_v_main_~y~0_39_46_102 0))))} is VALID [2022-04-15 12:50:54,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret13 := main(); {2065#true} is VALID [2022-04-15 12:50:54,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #72#return; {2065#true} is VALID [2022-04-15 12:50:54,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 12:50:54,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(10, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 12:50:54,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 12:50:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:54,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999877142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:54,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:54,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-15 12:50:56,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [596305521] [2022-04-15 12:50:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [596305521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:56,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:56,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:50:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842175865] [2022-04-15 12:50:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:56,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:50:56,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:56,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:56,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:56,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:50:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:56,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:50:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=871, Unknown=9, NotChecked=0, Total=1056 [2022-04-15 12:50:56,745 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:59,952 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 12:50:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:50:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:50:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-15 12:50:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-15 12:50:59,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 35 transitions. [2022-04-15 12:51:00,011 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-15 12:51:00,012 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:51:00,012 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:51:00,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=277, Invalid=1520, Unknown=9, NotChecked=0, Total=1806 [2022-04-15 12:51:00,013 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:00,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:51:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:51:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-15 12:51:00,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:00,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:00,128 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:00,128 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:00,128 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 12:51:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:51:00,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:00,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:00,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:00,129 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:00,130 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 12:51:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:51:00,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:00,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:00,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:00,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-04-15 12:51:00,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 19 [2022-04-15 12:51:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:00,131 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-04-15 12:51:00,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:00,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 31 transitions. [2022-04-15 12:51:00,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 12:51:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:51:00,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:00,218 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:00,223 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-15 12:51:00,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:00,418 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 2 times [2022-04-15 12:51:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:00,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799120264] [2022-04-15 12:51:00,608 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -639720411, now seen corresponding path program 1 times [2022-04-15 12:51:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836809248] [2022-04-15 12:51:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:00,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {2415#(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(10, 2);call #Ultimate.allocInit(12, 3); {2406#true} is VALID [2022-04-15 12:51:00,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-15 12:51:00,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2406#true} {2406#true} #72#return; {2406#true} is VALID [2022-04-15 12:51:00,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:00,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {2415#(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(10, 2);call #Ultimate.allocInit(12, 3); {2406#true} is VALID [2022-04-15 12:51:00,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-15 12:51:00,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #72#return; {2406#true} is VALID [2022-04-15 12:51:00,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret13 := main(); {2406#true} is VALID [2022-04-15 12:51:00,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2406#true} is VALID [2022-04-15 12:51:00,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_12| 0) (= |v_main_#t~post6_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2406#true} is VALID [2022-04-15 12:51:00,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2406#true} is VALID [2022-04-15 12:51:00,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#true} ~z~0 := ~y~0; {2411#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:00,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {2411#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2412#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:51:00,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:00,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:00,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:51:00,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:00,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#false} assume !(~x~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:00,706 INFO L272 TraceCheckUtils]: 15: Hoare triple {2407#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2407#false} is VALID [2022-04-15 12:51:00,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-15 12:51:00,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-15 12:51:00,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-15 12:51:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:00,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836809248] [2022-04-15 12:51:00,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836809248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:00,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134337842] [2022-04-15 12:51:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:00,708 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-15 12:51:00,709 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-15 12:51:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:00,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:51:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:00,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:01,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-15 12:51:01,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#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(10, 2);call #Ultimate.allocInit(12, 3); {2406#true} is VALID [2022-04-15 12:51:01,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-15 12:51:01,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #72#return; {2406#true} is VALID [2022-04-15 12:51:01,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret13 := main(); {2406#true} is VALID [2022-04-15 12:51:01,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2406#true} is VALID [2022-04-15 12:51:01,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_12| 0) (= |v_main_#t~post6_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2406#true} is VALID [2022-04-15 12:51:01,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2406#true} is VALID [2022-04-15 12:51:01,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#true} ~z~0 := ~y~0; {2411#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:01,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {2411#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2412#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:51:01,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:01,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:01,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:51:01,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:01,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#false} assume !(~x~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:01,062 INFO L272 TraceCheckUtils]: 15: Hoare triple {2407#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2407#false} is VALID [2022-04-15 12:51:01,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-15 12:51:01,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-15 12:51:01,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-15 12:51:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:01,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:01,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-04-15 12:51:01,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {2407#false} assume 0 == ~cond; {2407#false} is VALID [2022-04-15 12:51:01,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {2407#false} ~cond := #in~cond; {2407#false} is VALID [2022-04-15 12:51:01,306 INFO L272 TraceCheckUtils]: 15: Hoare triple {2407#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2407#false} is VALID [2022-04-15 12:51:01,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#false} assume !(~x~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:01,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2407#false} is VALID [2022-04-15 12:51:01,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2414#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:51:01,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:01,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {2497#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2413#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:51:01,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2497#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:51:01,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#true} ~z~0 := ~y~0; {2501#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:01,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#true} [92] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_12| 0) (= |v_main_#t~post6_Out_12| 0) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_18) (+ v_main_~x~0_In_9 v_main_~y~0_In_6)) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {2406#true} call #t~ret13 := main(); {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2406#true} {2406#true} #72#return; {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume true; {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#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(10, 2);call #Ultimate.allocInit(12, 3); {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {2406#true} call ULTIMATE.init(); {2406#true} is VALID [2022-04-15 12:51:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134337842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:01,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:01,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:51:01,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799120264] [2022-04-15 12:51:01,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799120264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:01,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:01,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:51:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619006519] [2022-04-15 12:51:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:51:01,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:01,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:01,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:51:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:51:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:51:01,373 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:01,741 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 12:51:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:51:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:51:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:51:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:51:01,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-15 12:51:01,789 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-15 12:51:01,790 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:51:01,790 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:51:01,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:51:01,790 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:01,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:51:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-15 12:51:01,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:01,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,844 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:01,845 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 12:51:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:51:01,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:01,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:01,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:01,846 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:01,846 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 12:51:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 12:51:01,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:01,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:01,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:01,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 12:51:01,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2022-04-15 12:51:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:01,847 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 12:51:01,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 12:51:01,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 12:51:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:51:01,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:01,939 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:01,957 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-15 12:51:02,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:02,144 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-15 12:51:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1359267157] [2022-04-15 12:51:02,299 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2086976367, now seen corresponding path program 1 times [2022-04-15 12:51:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:02,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164883210] [2022-04-15 12:51:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:02,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(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(10, 2);call #Ultimate.allocInit(12, 3); {2724#true} is VALID [2022-04-15 12:51:02,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:51:02,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #72#return; {2724#true} is VALID [2022-04-15 12:51:02,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:02,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(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(10, 2);call #Ultimate.allocInit(12, 3); {2724#true} is VALID [2022-04-15 12:51:02,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:51:02,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #72#return; {2724#true} is VALID [2022-04-15 12:51:02,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret13 := main(); {2724#true} is VALID [2022-04-15 12:51:02,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2724#true} is VALID [2022-04-15 12:51:02,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_10 v_main_~x~0_Out_20)) (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_7)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2724#true} is VALID [2022-04-15 12:51:02,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2725#false} is VALID [2022-04-15 12:51:02,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2725#false} assume !(~x~0 % 4294967296 > 0); {2725#false} is VALID [2022-04-15 12:51:02,355 INFO L272 TraceCheckUtils]: 16: Hoare triple {2725#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:51:02,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:51:02,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:51:02,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:51:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:02,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164883210] [2022-04-15 12:51:02,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164883210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:02,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628669934] [2022-04-15 12:51:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:02,356 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-15 12:51:02,357 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-15 12:51:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:02,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:51:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:02,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:02,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2022-04-15 12:51:02,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#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(10, 2);call #Ultimate.allocInit(12, 3); {2724#true} is VALID [2022-04-15 12:51:02,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:51:02,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #72#return; {2724#true} is VALID [2022-04-15 12:51:02,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret13 := main(); {2724#true} is VALID [2022-04-15 12:51:02,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2724#true} is VALID [2022-04-15 12:51:02,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_10 v_main_~x~0_Out_20)) (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_7)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2724#true} is VALID [2022-04-15 12:51:02,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {2725#false} assume !(~x~0 % 4294967296 > 0); {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L272 TraceCheckUtils]: 16: Hoare triple {2725#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:51:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:02,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:02,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 12:51:02,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {2725#false} assume 0 == ~cond; {2725#false} is VALID [2022-04-15 12:51:02,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {2725#false} ~cond := #in~cond; {2725#false} is VALID [2022-04-15 12:51:02,770 INFO L272 TraceCheckUtils]: 16: Hoare triple {2725#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2725#false} is VALID [2022-04-15 12:51:02,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {2725#false} assume !(~x~0 % 4294967296 > 0); {2725#false} is VALID [2022-04-15 12:51:02,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2725#false} is VALID [2022-04-15 12:51:02,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2730#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:02,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2729#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:02,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2724#true} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= v_main_~x~0_In_10 v_main_~x~0_Out_20)) (and (= |v_main_#t~post5_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_14 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_7)) (= |v_main_#t~post6_Out_14| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2724#true} is VALID [2022-04-15 12:51:02,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret13 := main(); {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #72#return; {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#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(10, 2);call #Ultimate.allocInit(12, 3); {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2022-04-15 12:51:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:02,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628669934] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:02,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:02,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 12:51:02,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:02,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1359267157] [2022-04-15 12:51:02,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1359267157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:02,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:02,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:51:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224753835] [2022-04-15 12:51:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:02,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 20 [2022-04-15 12:51:02,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:02,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:02,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:02,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:51:02,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:02,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:51:02,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:51:02,823 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:03,072 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:51:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:51:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 20 [2022-04-15 12:51:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:51:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 12:51:03,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 12:51:03,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:03,111 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:51:03,111 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:51:03,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:51:03,112 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:03,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 22 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:51:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-04-15 12:51:03,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:03,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,176 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,176 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:03,176 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 12:51:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 12:51:03,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:03,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:03,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:51:03,177 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:51:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:03,177 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 12:51:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 12:51:03,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:03,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:03,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:03,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 12:51:03,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2022-04-15 12:51:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:03,178 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 12:51:03,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:03,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 12:51:03,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 12:51:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:51:03,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:03,266 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:03,283 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-15 12:51:03,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:51:03,466 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-04-15 12:51:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:03,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121764019] [2022-04-15 12:51:03,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1148075074, now seen corresponding path program 1 times [2022-04-15 12:51:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:03,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773121943] [2022-04-15 12:51:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:03,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {3059#(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(10, 2);call #Ultimate.allocInit(12, 3); {3050#true} is VALID [2022-04-15 12:51:03,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-15 12:51:03,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3050#true} {3050#true} #72#return; {3050#true} is VALID [2022-04-15 12:51:03,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:03,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3059#(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(10, 2);call #Ultimate.allocInit(12, 3); {3050#true} is VALID [2022-04-15 12:51:03,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-15 12:51:03,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #72#return; {3050#true} is VALID [2022-04-15 12:51:03,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret13 := main(); {3050#true} is VALID [2022-04-15 12:51:03,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3050#true} is VALID [2022-04-15 12:51:03,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {3050#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_11 v_main_~x~0_Out_22) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_22)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3050#true} is VALID [2022-04-15 12:51:03,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3050#true} is VALID [2022-04-15 12:51:03,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#true} ~z~0 := ~y~0; {3055#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:03,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3056#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:51:03,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {3056#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3057#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:51:03,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {3057#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {3051#false} assume !(~y~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {3051#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {3051#false} assume !(~x~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L272 TraceCheckUtils]: 16: Hoare triple {3051#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2022-04-15 12:51:03,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-15 12:51:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773121943] [2022-04-15 12:51:03,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773121943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953334920] [2022-04-15 12:51:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:03,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:03,660 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-15 12:51:03,661 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-15 12:51:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:03,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:51:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:03,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:03,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-15 12:51:03,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#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(10, 2);call #Ultimate.allocInit(12, 3); {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #72#return; {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret13 := main(); {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {3050#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_11 v_main_~x~0_Out_22) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_22)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3050#true} is VALID [2022-04-15 12:51:03,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#true} ~z~0 := ~y~0; {3055#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:03,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3056#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:51:03,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {3056#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3093#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:51:03,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {3093#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:03,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3051#false} is VALID [2022-04-15 12:51:03,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {3051#false} assume !(~y~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:03,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {3051#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3051#false} is VALID [2022-04-15 12:51:03,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {3051#false} assume !(~x~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:03,954 INFO L272 TraceCheckUtils]: 16: Hoare triple {3051#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3051#false} is VALID [2022-04-15 12:51:03,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2022-04-15 12:51:03,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2022-04-15 12:51:03,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-15 12:51:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:03,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:04,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2022-04-15 12:51:04,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2022-04-15 12:51:04,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2022-04-15 12:51:04,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {3051#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3051#false} is VALID [2022-04-15 12:51:04,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {3051#false} assume !(~x~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:04,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {3051#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3051#false} is VALID [2022-04-15 12:51:04,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {3051#false} assume !(~y~0 % 4294967296 > 0); {3051#false} is VALID [2022-04-15 12:51:04,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3051#false} is VALID [2022-04-15 12:51:04,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {3093#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3058#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:04,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {3148#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3093#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-15 12:51:04,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {3152#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3148#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:51:04,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#true} ~z~0 := ~y~0; {3152#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:51:04,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#true} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3050#true} is VALID [2022-04-15 12:51:04,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {3050#true} [96] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_11 v_main_~x~0_Out_22) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (= |v_main_#t~post6_Out_16| 0) (= (+ v_main_~x~0_In_11 v_main_~y~0_In_8) (+ v_main_~y~0_Out_16 v_main_~x~0_Out_22)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret13 := main(); {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #72#return; {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {3050#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(10, 2);call #Ultimate.allocInit(12, 3); {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2022-04-15 12:51:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:04,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953334920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:04,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:04,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 12:51:04,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:04,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121764019] [2022-04-15 12:51:04,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121764019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:04,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:04,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:51:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899250930] [2022-04-15 12:51:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:04,386 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, (3), 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 20 [2022-04-15 12:51:04,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:04,386 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:04,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:04,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:51:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:51:04,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:51:04,406 INFO L87 Difference]: Start difference. First operand 26 states and 31 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:04,782 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 12:51:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:51:04,782 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, (3), 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 20 [2022-04-15 12:51:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:04,782 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:51:04,783 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:51:04,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:51:04,818 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-15 12:51:04,829 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:51:04,829 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:51:04,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:51:04,830 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:04,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 41 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:51:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 12:51:04,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:04,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,866 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,866 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:04,867 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:51:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 12:51:04,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:04,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:04,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,867 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:04,868 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:51:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 12:51:04,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:04,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:04,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:04,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-15 12:51:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 12:51:04,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 20 [2022-04-15 12:51:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:04,869 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 12:51:04,869 INFO L479 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:04,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 12:51:04,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:51:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:51:04,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:04,910 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:04,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:51:05,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:05,121 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash -629354303, now seen corresponding path program 3 times [2022-04-15 12:51:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:05,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244787228] [2022-04-15 12:51:05,257 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1712942558, now seen corresponding path program 1 times [2022-04-15 12:51:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:05,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861556352] [2022-04-15 12:51:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:05,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {3357#(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(10, 2);call #Ultimate.allocInit(12, 3); {3347#true} is VALID [2022-04-15 12:51:05,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {3347#true} assume true; {3347#true} is VALID [2022-04-15 12:51:05,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3347#true} {3347#true} #72#return; {3347#true} is VALID [2022-04-15 12:51:05,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {3347#true} call ULTIMATE.init(); {3357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:05,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {3357#(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(10, 2);call #Ultimate.allocInit(12, 3); {3347#true} is VALID [2022-04-15 12:51:05,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {3347#true} assume true; {3347#true} is VALID [2022-04-15 12:51:05,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3347#true} {3347#true} #72#return; {3347#true} is VALID [2022-04-15 12:51:05,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {3347#true} call #t~ret13 := main(); {3347#true} is VALID [2022-04-15 12:51:05,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {3347#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3352#(= main_~y~0 0)} is VALID [2022-04-15 12:51:05,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {3352#(= main_~y~0 0)} [98] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_9)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3353#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-15 12:51:05,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:05,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:05,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3355#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:51:05,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {3355#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:51:05,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:51:05,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:51:05,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:51:05,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:51:05,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {3356#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3348#false} is VALID [2022-04-15 12:51:05,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {3348#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3348#false} is VALID [2022-04-15 12:51:05,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {3348#false} ~cond := #in~cond; {3348#false} is VALID [2022-04-15 12:51:05,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {3348#false} assume 0 == ~cond; {3348#false} is VALID [2022-04-15 12:51:05,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {3348#false} assume !false; {3348#false} is VALID [2022-04-15 12:51:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:51:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861556352] [2022-04-15 12:51:05,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861556352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968614913] [2022-04-15 12:51:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:05,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:05,375 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-15 12:51:05,375 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-15 12:51:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:05,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:51:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:05,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:05,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3347#true} call ULTIMATE.init(); {3347#true} is VALID [2022-04-15 12:51:05,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3347#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(10, 2);call #Ultimate.allocInit(12, 3); {3347#true} is VALID [2022-04-15 12:51:05,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3347#true} assume true; {3347#true} is VALID [2022-04-15 12:51:05,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3347#true} {3347#true} #72#return; {3347#true} is VALID [2022-04-15 12:51:05,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {3347#true} call #t~ret13 := main(); {3347#true} is VALID [2022-04-15 12:51:05,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {3347#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3347#true} is VALID [2022-04-15 12:51:05,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {3347#true} [98] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_9)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3347#true} is VALID [2022-04-15 12:51:05,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {3347#true} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:05,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:05,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {3354#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3355#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 12:51:05,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {3355#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:51:05,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:51:05,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:51:05,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:51:05,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:51:05,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {3391#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3348#false} is VALID [2022-04-15 12:51:05,594 INFO L272 TraceCheckUtils]: 16: Hoare triple {3348#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3348#false} is VALID [2022-04-15 12:51:05,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {3348#false} ~cond := #in~cond; {3348#false} is VALID [2022-04-15 12:51:05,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {3348#false} assume 0 == ~cond; {3348#false} is VALID [2022-04-15 12:51:05,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {3348#false} assume !false; {3348#false} is VALID [2022-04-15 12:51:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:51:05,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:05,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {3348#false} assume !false; {3348#false} is VALID [2022-04-15 12:51:05,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {3348#false} assume 0 == ~cond; {3348#false} is VALID [2022-04-15 12:51:05,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {3348#false} ~cond := #in~cond; {3348#false} is VALID [2022-04-15 12:51:05,798 INFO L272 TraceCheckUtils]: 16: Hoare triple {3348#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3348#false} is VALID [2022-04-15 12:51:05,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3348#false} is VALID [2022-04-15 12:51:05,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3431#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:51:05,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {3431#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3431#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:51:05,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {3431#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3431#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:51:05,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {3431#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3431#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:51:05,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {3447#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3431#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:51:05,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3447#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 12:51:05,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3451#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:51:05,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {3347#true} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3451#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:51:05,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {3347#true} [98] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_9)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3347#true} is VALID [2022-04-15 12:51:05,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {3347#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {3347#true} call #t~ret13 := main(); {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3347#true} {3347#true} #72#return; {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {3347#true} assume true; {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3347#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(10, 2);call #Ultimate.allocInit(12, 3); {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {3347#true} call ULTIMATE.init(); {3347#true} is VALID [2022-04-15 12:51:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:51:05,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968614913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:05,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:05,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2022-04-15 12:51:05,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244787228] [2022-04-15 12:51:05,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244787228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:05,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:05,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:51:05,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289542110] [2022-04-15 12:51:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:51:05,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:05,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:05,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:05,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:51:05,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:05,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:51:05,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:51:05,897 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:06,405 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 12:51:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:51:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:51:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:51:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-15 12:51:06,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-15 12:51:06,450 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-15 12:51:06,450 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:51:06,450 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:51:06,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:51:06,451 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:06,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:51:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 12:51:06,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:06,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,508 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,508 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:06,509 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 12:51:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 12:51:06,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:06,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:06,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:06,509 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:51:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:06,510 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 12:51:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 12:51:06,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:06,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:06,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:06,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-15 12:51:06,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2022-04-15 12:51:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:06,511 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-15 12:51:06,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:06,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-15 12:51:06,601 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-15 12:51:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 12:51:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:51:06,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:06,601 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:06,618 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-15 12:51:06,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:06,802 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1999348183, now seen corresponding path program 4 times [2022-04-15 12:51:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:06,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1666183235] [2022-04-15 12:51:06,953 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash 476869718, now seen corresponding path program 1 times [2022-04-15 12:51:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:06,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792143030] [2022-04-15 12:51:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:07,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {3685#(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(10, 2);call #Ultimate.allocInit(12, 3); {3673#true} is VALID [2022-04-15 12:51:07,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {3673#true} assume true; {3673#true} is VALID [2022-04-15 12:51:07,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3673#true} {3673#true} #72#return; {3673#true} is VALID [2022-04-15 12:51:07,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {3673#true} call ULTIMATE.init(); {3685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:07,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {3685#(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(10, 2);call #Ultimate.allocInit(12, 3); {3673#true} is VALID [2022-04-15 12:51:07,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {3673#true} assume true; {3673#true} is VALID [2022-04-15 12:51:07,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3673#true} {3673#true} #72#return; {3673#true} is VALID [2022-04-15 12:51:07,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {3673#true} call #t~ret13 := main(); {3673#true} is VALID [2022-04-15 12:51:07,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {3673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3678#(= main_~y~0 0)} is VALID [2022-04-15 12:51:07,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {3678#(= main_~y~0 0)} [100] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_13 v_main_~x~0_Out_26)) (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3679#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:51:07,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {3679#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3679#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:51:07,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {3679#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {3680#(and (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0)))} is VALID [2022-04-15 12:51:07,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {3680#(and (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3681#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:07,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3682#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:51:07,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {3682#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {3682#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:51:07,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {3682#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:51:07,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3674#false} is VALID [2022-04-15 12:51:07,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {3674#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3674#false} is VALID [2022-04-15 12:51:07,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {3674#false} ~cond := #in~cond; {3674#false} is VALID [2022-04-15 12:51:07,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {3674#false} assume 0 == ~cond; {3674#false} is VALID [2022-04-15 12:51:07,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {3674#false} assume !false; {3674#false} is VALID [2022-04-15 12:51:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:51:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:07,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792143030] [2022-04-15 12:51:07,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792143030] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:07,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298544938] [2022-04-15 12:51:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:07,122 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-15 12:51:07,122 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-15 12:51:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:07,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:51:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:07,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:07,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {3673#true} call ULTIMATE.init(); {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {3673#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(10, 2);call #Ultimate.allocInit(12, 3); {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {3673#true} assume true; {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3673#true} {3673#true} #72#return; {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {3673#true} call #t~ret13 := main(); {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {3673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3673#true} is VALID [2022-04-15 12:51:07,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {3673#true} [100] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_13 v_main_~x~0_Out_26)) (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3673#true} is VALID [2022-04-15 12:51:07,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {3673#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3710#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:07,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {3710#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {3710#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:07,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {3710#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3717#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:51:07,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {3717#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:51:07,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:51:07,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:51:07,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:51:07,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:51:07,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {3721#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3717#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:51:07,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {3717#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3674#false} is VALID [2022-04-15 12:51:07,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {3674#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3674#false} is VALID [2022-04-15 12:51:07,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {3674#false} ~cond := #in~cond; {3674#false} is VALID [2022-04-15 12:51:07,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {3674#false} assume 0 == ~cond; {3674#false} is VALID [2022-04-15 12:51:07,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {3674#false} assume !false; {3674#false} is VALID [2022-04-15 12:51:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:51:07,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:07,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {3674#false} assume !false; {3674#false} is VALID [2022-04-15 12:51:07,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {3674#false} assume 0 == ~cond; {3674#false} is VALID [2022-04-15 12:51:07,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {3674#false} ~cond := #in~cond; {3674#false} is VALID [2022-04-15 12:51:07,577 INFO L272 TraceCheckUtils]: 17: Hoare triple {3674#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3674#false} is VALID [2022-04-15 12:51:07,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3674#false} is VALID [2022-04-15 12:51:07,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:51:07,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3683#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:07,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {3785#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3684#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:51:07,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {3785#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {3785#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:51:07,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3673#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3785#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:51:07,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {3673#true} [100] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_13 v_main_~x~0_Out_26)) (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~x~0_In_13 v_main_~y~0_In_10) (+ v_main_~y~0_Out_20 v_main_~x~0_Out_26)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {3673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {3673#true} call #t~ret13 := main(); {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3673#true} {3673#true} #72#return; {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3673#true} assume true; {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3673#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(10, 2);call #Ultimate.allocInit(12, 3); {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3673#true} call ULTIMATE.init(); {3673#true} is VALID [2022-04-15 12:51:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:51:07,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298544938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:07,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:07,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2022-04-15 12:51:07,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:07,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1666183235] [2022-04-15 12:51:07,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1666183235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:07,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:07,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:51:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843707404] [2022-04-15 12:51:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-15 12:51:07,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:07,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:07,695 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-15 12:51:07,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:51:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:51:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:51:07,696 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:08,280 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 12:51:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:51:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-15 12:51:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-15 12:51:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-15 12:51:08,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-15 12:51:08,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:08,330 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:51:08,330 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:51:08,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:51:08,331 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:08,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:51:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:51:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 12:51:08,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:08,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,405 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,405 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:08,406 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:51:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:51:08,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:08,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:08,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 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 33 states. [2022-04-15 12:51:08,406 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 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 33 states. [2022-04-15 12:51:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:08,407 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:51:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:51:08,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:08,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:08,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:08,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-15 12:51:08,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 21 [2022-04-15 12:51:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:08,408 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-15 12:51:08,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:08,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-15 12:51:08,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 12:51:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:51:08,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:08,524 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:08,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 12:51:08,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 12:51:08,725 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1884746625, now seen corresponding path program 5 times [2022-04-15 12:51:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:08,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710240660] [2022-04-15 12:51:08,862 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash -368377566, now seen corresponding path program 1 times [2022-04-15 12:51:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:08,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104071326] [2022-04-15 12:51:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:09,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:09,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {4057#(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(10, 2);call #Ultimate.allocInit(12, 3); {4039#true} is VALID [2022-04-15 12:51:09,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:51:09,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4039#true} {4039#true} #72#return; {4039#true} is VALID [2022-04-15 12:51:09,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:09,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {4057#(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(10, 2);call #Ultimate.allocInit(12, 3); {4039#true} is VALID [2022-04-15 12:51:09,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:51:09,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #72#return; {4039#true} is VALID [2022-04-15 12:51:09,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret13 := main(); {4039#true} is VALID [2022-04-15 12:51:09,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4044#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:51:09,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {4044#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_11)) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4045#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:51:09,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {4045#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4046#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:51:09,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {4046#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {4047#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-15 12:51:09,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {4047#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4048#(<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1))} is VALID [2022-04-15 12:51:09,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {4048#(<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4049#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2) main_~n~0)} is VALID [2022-04-15 12:51:09,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {4049#(<= (+ (* (div (+ 2147483645 main_~n~0 (* (- 1) main_~z~0)) 2147483648) 2147483648) main_~z~0 2) main_~n~0)} assume !(~z~0 % 4294967296 > 0); {4050#(and (<= (+ main_~z~0 (* (div (+ 4294967291 (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4) (* main_~n~0 2)) (<= (div (* main_~n~0 2) 4294967296) (+ (div main_~z~0 4294967296) (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296))))} is VALID [2022-04-15 12:51:09,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(and (<= (+ main_~z~0 (* (div (+ 4294967291 (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4) (* main_~n~0 2)) (<= (div (* main_~n~0 2) 4294967296) (+ (div main_~z~0 4294967296) (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4051#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ main_~z~0 3 (* (div (+ 4294967292 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)))} is VALID [2022-04-15 12:51:09,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {4051#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ main_~z~0 3 (* (div (+ 4294967292 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4052#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} is VALID [2022-04-15 12:51:09,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {4052#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} assume !(~y~0 % 4294967296 > 0); {4052#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} is VALID [2022-04-15 12:51:09,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {4052#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4053#(and (<= (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967294) 4294967296)) 1) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:51:09,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {4053#(and (<= (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967294) 4294967296)) 1) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:09,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:51:09,417 INFO L272 TraceCheckUtils]: 18: Hoare triple {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4055#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:51:09,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {4055#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4056#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:51:09,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {4056#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:51:09,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:51:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:09,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104071326] [2022-04-15 12:51:09,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104071326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234006682] [2022-04-15 12:51:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:09,420 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-15 12:51:09,420 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-15 12:51:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:09,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:51:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:09,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:27,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2022-04-15 12:51:27,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#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(10, 2);call #Ultimate.allocInit(12, 3); {4039#true} is VALID [2022-04-15 12:51:27,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:51:27,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #72#return; {4039#true} is VALID [2022-04-15 12:51:27,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret13 := main(); {4039#true} is VALID [2022-04-15 12:51:27,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4044#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:51:27,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {4044#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_11)) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4079#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:51:27,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {4079#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4083#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:51:27,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {4083#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {4087#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:51:27,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {4087#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4091#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:51:27,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {4091#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4095#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 12:51:27,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {4095#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0) 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {4099#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:51:27,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {4099#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4103#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 2)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 1) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:51:27,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {4103#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 2)) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 1) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4107#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:51:27,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {4107#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} assume !(~y~0 % 4294967296 > 0); {4111#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:51:27,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {4111#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4115#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:51:27,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {4115#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4119#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:51:27,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {4119#(and (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {4123#(and (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:51:27,892 INFO L272 TraceCheckUtils]: 18: Hoare triple {4123#(and (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:51:27,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:51:27,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {4131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:51:27,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:51:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:27,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:03,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2022-04-15 12:52:03,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {4131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4040#false} is VALID [2022-04-15 12:52:03,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:52:03,356 INFO L272 TraceCheckUtils]: 18: Hoare triple {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:52:03,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {4150#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {4054#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:03,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {4154#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4150#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:52:03,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {4158#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4154#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-15 12:52:03,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {4162#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4158#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:52:03,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {4166#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4162#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:52:03,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {4170#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4166#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:52:03,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {4174#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4170#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:52:03,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4174#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:52:03,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4182#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4178#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:52:03,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {4186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {4182#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:52:03,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {4186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:03,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {4193#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) 3 (div (+ main_~y~0 main_~x~0 2 (* (- 2) main_~n~0)) 4294967296)))) (or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967292 (* main_~n~0 2)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967294)) 4294967296) 2))))} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_28) (+ v_main_~x~0_In_14 v_main_~y~0_In_11)) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:03,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {4039#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4193#(and (or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) 3 (div (+ main_~y~0 main_~x~0 2 (* (- 2) main_~n~0)) 4294967296)))) (or (< (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 main_~x~0 4294967293) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* (- 1) main_~x~0) (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967292 (* main_~n~0 2)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967294)) 4294967296) 2))))} is VALID [2022-04-15 12:52:03,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret13 := main(); {4039#true} is VALID [2022-04-15 12:52:03,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #72#return; {4039#true} is VALID [2022-04-15 12:52:03,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2022-04-15 12:52:03,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {4039#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(10, 2);call #Ultimate.allocInit(12, 3); {4039#true} is VALID [2022-04-15 12:52:03,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2022-04-15 12:52:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:03,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234006682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:03,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:03,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 41 [2022-04-15 12:52:04,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:04,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710240660] [2022-04-15 12:52:04,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710240660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:04,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:04,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:52:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973907449] [2022-04-15 12:52:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:52:04,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:04,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:04,141 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-15 12:52:04,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:52:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:52:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1527, Unknown=2, NotChecked=0, Total=1806 [2022-04-15 12:52:04,142 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,367 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 12:52:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:52:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:52:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2022-04-15 12:52:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2022-04-15 12:52:07,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 40 transitions. [2022-04-15 12:52:07,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:07,579 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:52:07,579 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:52:07,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=411, Invalid=2667, Unknown=2, NotChecked=0, Total=3080 [2022-04-15 12:52:07,580 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:07,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:52:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:52:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-04-15 12:52:07,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:07,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,671 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,671 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,672 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 12:52:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 12:52:07,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:07,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:07,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 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 40 states. [2022-04-15 12:52:07,673 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 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 40 states. [2022-04-15 12:52:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:07,673 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 12:52:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 12:52:07,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:07,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:07,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:07,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-15 12:52:07,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2022-04-15 12:52:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:07,674 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-15 12:52:07,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:07,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions. [2022-04-15 12:52:07,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:52:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:52:07,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:07,885 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:07,890 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-15 12:52:08,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:52:08,087 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1383526881, now seen corresponding path program 6 times [2022-04-15 12:52:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:08,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715316379] [2022-04-15 12:52:08,225 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1124437954, now seen corresponding path program 1 times [2022-04-15 12:52:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:08,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127372993] [2022-04-15 12:52:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {4489#(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(10, 2);call #Ultimate.allocInit(12, 3); {4478#true} is VALID [2022-04-15 12:52:08,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {4478#true} assume true; {4478#true} is VALID [2022-04-15 12:52:08,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4478#true} {4478#true} #72#return; {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {4478#true} call ULTIMATE.init(); {4489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:08,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {4489#(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(10, 2);call #Ultimate.allocInit(12, 3); {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {4478#true} assume true; {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4478#true} {4478#true} #72#return; {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {4478#true} call #t~ret13 := main(); {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {4478#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_15 v_main_~x~0_Out_30) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_30)) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4478#true} is VALID [2022-04-15 12:52:08,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4478#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4478#true} is VALID [2022-04-15 12:52:08,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {4478#true} ~z~0 := ~y~0; {4483#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:08,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {4483#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:08,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {4484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:08,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:08,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:08,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:08,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {4479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {4479#false} assume !(~x~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {4479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {4479#false} ~cond := #in~cond; {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {4479#false} assume 0 == ~cond; {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {4479#false} assume !false; {4479#false} is VALID [2022-04-15 12:52:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:08,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127372993] [2022-04-15 12:52:08,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127372993] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:08,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674859065] [2022-04-15 12:52:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:08,372 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:08,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:52:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:52:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:08,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {4478#true} call ULTIMATE.init(); {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {4478#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(10, 2);call #Ultimate.allocInit(12, 3); {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {4478#true} assume true; {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4478#true} {4478#true} #72#return; {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {4478#true} call #t~ret13 := main(); {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {4478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {4478#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_15 v_main_~x~0_Out_30) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_30)) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4478#true} is VALID [2022-04-15 12:52:08,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {4478#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4478#true} is VALID [2022-04-15 12:52:08,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {4478#true} ~z~0 := ~y~0; {4483#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:08,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {4483#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:08,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {4484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:08,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:08,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:08,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:08,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:08,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:08,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {4479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4479#false} is VALID [2022-04-15 12:52:08,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {4479#false} assume !(~x~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:08,762 INFO L272 TraceCheckUtils]: 18: Hoare triple {4479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4479#false} is VALID [2022-04-15 12:52:08,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {4479#false} ~cond := #in~cond; {4479#false} is VALID [2022-04-15 12:52:08,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {4479#false} assume 0 == ~cond; {4479#false} is VALID [2022-04-15 12:52:08,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {4479#false} assume !false; {4479#false} is VALID [2022-04-15 12:52:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:08,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:09,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {4479#false} assume !false; {4479#false} is VALID [2022-04-15 12:52:09,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {4479#false} assume 0 == ~cond; {4479#false} is VALID [2022-04-15 12:52:09,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {4479#false} ~cond := #in~cond; {4479#false} is VALID [2022-04-15 12:52:09,049 INFO L272 TraceCheckUtils]: 18: Hoare triple {4479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4479#false} is VALID [2022-04-15 12:52:09,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {4479#false} assume !(~x~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:09,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {4479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4479#false} is VALID [2022-04-15 12:52:09,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4479#false} is VALID [2022-04-15 12:52:09,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4488#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:09,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4487#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:09,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:09,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {4586#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4486#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:09,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {4590#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4586#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:52:09,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {4594#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4590#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-15 12:52:09,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {4478#true} ~z~0 := ~y~0; {4594#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:52:09,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {4478#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {4478#true} [104] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_15 v_main_~x~0_Out_30) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_30)) (= |v_main_#t~post6_Out_24| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4478#true} call #t~ret13 := main(); {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4478#true} {4478#true} #72#return; {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {4478#true} assume true; {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {4478#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(10, 2);call #Ultimate.allocInit(12, 3); {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {4478#true} call ULTIMATE.init(); {4478#true} is VALID [2022-04-15 12:52:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:09,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674859065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:09,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:09,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 12:52:09,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715316379] [2022-04-15 12:52:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715316379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:09,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:09,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:52:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897669559] [2022-04-15 12:52:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:52:09,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:09,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:09,108 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-15 12:52:09,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:52:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:52:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:52:09,109 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:10,097 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-15 12:52:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:52:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:52:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-15 12:52:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-15 12:52:10,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 47 transitions. [2022-04-15 12:52:10,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:10,212 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:52:10,212 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:52:10,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:52:10,213 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:10,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:52:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 12:52:10,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:10,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,346 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,347 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:10,347 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-15 12:52:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-15 12:52:10,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:10,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:10,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 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-15 12:52:10,348 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 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-15 12:52:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:10,348 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-15 12:52:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-15 12:52:10,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:10,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:10,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:10,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 12:52:10,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 22 [2022-04-15 12:52:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:10,349 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 12:52:10,350 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:10,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 12:52:10,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 12:52:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:52:10,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:10,867 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:10,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:11,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:52:11,068 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 512162856, now seen corresponding path program 7 times [2022-04-15 12:52:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:11,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225814118] [2022-04-15 12:52:11,166 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1539075545, now seen corresponding path program 1 times [2022-04-15 12:52:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749667336] [2022-04-15 12:52:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:11,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {4944#(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(10, 2);call #Ultimate.allocInit(12, 3); {4934#true} is VALID [2022-04-15 12:52:11,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {4934#true} assume true; {4934#true} is VALID [2022-04-15 12:52:11,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4934#true} {4934#true} #72#return; {4934#true} is VALID [2022-04-15 12:52:11,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {4934#true} call ULTIMATE.init(); {4944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:11,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {4944#(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(10, 2);call #Ultimate.allocInit(12, 3); {4934#true} is VALID [2022-04-15 12:52:11,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {4934#true} assume true; {4934#true} is VALID [2022-04-15 12:52:11,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4934#true} {4934#true} #72#return; {4934#true} is VALID [2022-04-15 12:52:11,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {4934#true} call #t~ret13 := main(); {4934#true} is VALID [2022-04-15 12:52:11,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {4934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4934#true} is VALID [2022-04-15 12:52:11,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {4934#true} [106] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_13)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4934#true} is VALID [2022-04-15 12:52:11,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {4934#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:11,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:11,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4940#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} is VALID [2022-04-15 12:52:11,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {4940#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4941#(<= main_~x~0 (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {4941#(<= main_~x~0 (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {4942#(<= main_~x~0 (+ 3 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:11,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4935#false} is VALID [2022-04-15 12:52:11,279 INFO L272 TraceCheckUtils]: 19: Hoare triple {4935#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4935#false} is VALID [2022-04-15 12:52:11,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {4935#false} ~cond := #in~cond; {4935#false} is VALID [2022-04-15 12:52:11,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {4935#false} assume 0 == ~cond; {4935#false} is VALID [2022-04-15 12:52:11,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {4935#false} assume !false; {4935#false} is VALID [2022-04-15 12:52:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749667336] [2022-04-15 12:52:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749667336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154169328] [2022-04-15 12:52:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:11,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:52:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:11,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:52:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:11,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:11,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {4934#true} call ULTIMATE.init(); {4934#true} is VALID [2022-04-15 12:52:11,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4934#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(10, 2);call #Ultimate.allocInit(12, 3); {4934#true} is VALID [2022-04-15 12:52:11,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {4934#true} assume true; {4934#true} is VALID [2022-04-15 12:52:11,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4934#true} {4934#true} #72#return; {4934#true} is VALID [2022-04-15 12:52:11,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {4934#true} call #t~ret13 := main(); {4934#true} is VALID [2022-04-15 12:52:11,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {4934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4934#true} is VALID [2022-04-15 12:52:11,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {4934#true} [106] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_13)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4934#true} is VALID [2022-04-15 12:52:11,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {4934#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:11,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:11,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {4939#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4975#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:52:11,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {4975#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4979#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {4979#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {4983#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4979#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:11,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {4979#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4935#false} is VALID [2022-04-15 12:52:11,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {4935#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4935#false} is VALID [2022-04-15 12:52:11,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {4935#false} ~cond := #in~cond; {4935#false} is VALID [2022-04-15 12:52:11,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {4935#false} assume 0 == ~cond; {4935#false} is VALID [2022-04-15 12:52:11,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {4935#false} assume !false; {4935#false} is VALID [2022-04-15 12:52:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:11,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:11,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {4935#false} assume !false; {4935#false} is VALID [2022-04-15 12:52:11,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {4935#false} assume 0 == ~cond; {4935#false} is VALID [2022-04-15 12:52:11,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {4935#false} ~cond := #in~cond; {4935#false} is VALID [2022-04-15 12:52:11,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {4935#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4935#false} is VALID [2022-04-15 12:52:11,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4935#false} is VALID [2022-04-15 12:52:11,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:11,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5032#(<= (+ 2 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 12:52:11,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {5054#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4943#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:11,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {5058#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5054#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 12:52:11,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {5058#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} ~z~0 := ~y~0; {5058#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} is VALID [2022-04-15 12:52:11,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {4934#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5058#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) (+ main_~x~0 1))} is VALID [2022-04-15 12:52:11,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {4934#true} [106] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_13 v_main_~y~0_Out_26)) (and (= |v_main_#t~post6_Out_26| 0) (= (+ v_main_~y~0_Out_26 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_13)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_26| 0))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {4934#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {4934#true} call #t~ret13 := main(); {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4934#true} {4934#true} #72#return; {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {4934#true} assume true; {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {4934#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(10, 2);call #Ultimate.allocInit(12, 3); {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {4934#true} call ULTIMATE.init(); {4934#true} is VALID [2022-04-15 12:52:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:11,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154169328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:11,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:11,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-04-15 12:52:11,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:11,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225814118] [2022-04-15 12:52:11,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225814118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:11,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:11,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:52:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479768936] [2022-04-15 12:52:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:11,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 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 23 [2022-04-15 12:52:11,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:11,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:11,919 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-15 12:52:11,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:52:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:52:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:52:11,920 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:12,654 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 12:52:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:52:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 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 23 [2022-04-15 12:52:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 12:52:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 12:52:12,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 12:52:12,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:12,751 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:52:12,751 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:52:12,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:52:12,751 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:12,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:52:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:52:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-04-15 12:52:12,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:12,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,931 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,931 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:12,932 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-15 12:52:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 12:52:12,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:12,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:12,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:52:12,932 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:52:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:12,933 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-15 12:52:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 12:52:12,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:12,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:12,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:12,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 12:52:12,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 23 [2022-04-15 12:52:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:12,934 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 12:52:12,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:12,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 12:52:13,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 12:52:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:52:13,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:13,770 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:13,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:13,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:13,970 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1268325552, now seen corresponding path program 8 times [2022-04-15 12:52:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:13,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772905982] [2022-04-15 12:52:14,070 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 280268145, now seen corresponding path program 1 times [2022-04-15 12:52:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:14,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579086561] [2022-04-15 12:52:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:14,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {5462#(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(10, 2);call #Ultimate.allocInit(12, 3); {5448#true} is VALID [2022-04-15 12:52:14,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-15 12:52:14,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5448#true} {5448#true} #72#return; {5448#true} is VALID [2022-04-15 12:52:14,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:14,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {5462#(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(10, 2);call #Ultimate.allocInit(12, 3); {5448#true} is VALID [2022-04-15 12:52:14,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-15 12:52:14,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #72#return; {5448#true} is VALID [2022-04-15 12:52:14,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret13 := main(); {5448#true} is VALID [2022-04-15 12:52:14,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5453#(= main_~y~0 0)} is VALID [2022-04-15 12:52:14,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {5453#(= main_~y~0 0)} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_34)) (= |v_main_#t~post5_Out_28| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5454#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:52:14,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {5454#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5454#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 12:52:14,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {5454#(or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0))} ~z~0 := ~y~0; {5455#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:52:14,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {5455#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5456#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:14,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {5456#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5457#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} is VALID [2022-04-15 12:52:14,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {5457#(and (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (not (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5458#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:14,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {5458#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5458#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:14,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {5458#(and (not (= main_~y~0 0)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:14,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5449#false} is VALID [2022-04-15 12:52:14,283 INFO L272 TraceCheckUtils]: 20: Hoare triple {5449#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5449#false} is VALID [2022-04-15 12:52:14,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-15 12:52:14,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-15 12:52:14,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-15 12:52:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:52:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:14,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579086561] [2022-04-15 12:52:14,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579086561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:14,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059368765] [2022-04-15 12:52:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:14,285 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:14,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:52:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:14,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:52:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:14,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:14,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2022-04-15 12:52:14,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#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(10, 2);call #Ultimate.allocInit(12, 3); {5448#true} is VALID [2022-04-15 12:52:14,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-15 12:52:14,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #72#return; {5448#true} is VALID [2022-04-15 12:52:14,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret13 := main(); {5448#true} is VALID [2022-04-15 12:52:14,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5453#(= main_~y~0 0)} is VALID [2022-04-15 12:52:14,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {5453#(= main_~y~0 0)} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_34)) (= |v_main_#t~post5_Out_28| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5484#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:14,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {5484#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5484#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:14,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {5484#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {5491#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} is VALID [2022-04-15 12:52:14,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {5491#(or (= main_~z~0 0) (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5495#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} is VALID [2022-04-15 12:52:14,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {5495#(or (and (<= 0 (+ main_~z~0 1)) (< 0 (mod main_~x~0 4294967296))) (= (+ main_~z~0 1) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5499#(or (= (+ main_~z~0 2) 0) (and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 0 (+ main_~z~0 2))))} is VALID [2022-04-15 12:52:14,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {5499#(or (= (+ main_~z~0 2) 0) (and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 0 (+ main_~z~0 2))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5503#(or (= (+ main_~z~0 3) 0) (and (<= 0 (+ main_~z~0 3)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:52:14,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {5503#(or (= (+ main_~z~0 3) 0) (and (<= 0 (+ main_~z~0 3)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:14,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:14,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5449#false} is VALID [2022-04-15 12:52:14,829 INFO L272 TraceCheckUtils]: 20: Hoare triple {5449#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5449#false} is VALID [2022-04-15 12:52:14,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-15 12:52:14,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-15 12:52:14,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-15 12:52:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:14,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:15,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-15 12:52:15,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-15 12:52:15,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-15 12:52:15,508 INFO L272 TraceCheckUtils]: 20: Hoare triple {5449#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5449#false} is VALID [2022-04-15 12:52:15,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5449#false} is VALID [2022-04-15 12:52:15,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5461#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 12:52:15,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5460#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5459#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:15,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(or (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5573#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:15,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {5581#(or (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5577#(or (<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:52:15,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {5585#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5581#(or (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:52:15,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {5589#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {5585#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:52:15,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {5589#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5589#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:52:15,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {5596#(< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2))} [108] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~x~0_In_17 v_main_~y~0_In_14) (+ v_main_~y~0_Out_28 v_main_~x~0_Out_34)) (= |v_main_#t~post5_Out_28| 0) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5589#(or (<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:52:15,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5596#(< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2))} is VALID [2022-04-15 12:52:15,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret13 := main(); {5448#true} is VALID [2022-04-15 12:52:15,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #72#return; {5448#true} is VALID [2022-04-15 12:52:15,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-15 12:52:15,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#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(10, 2);call #Ultimate.allocInit(12, 3); {5448#true} is VALID [2022-04-15 12:52:15,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2022-04-15 12:52:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:52:15,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059368765] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:15,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:15,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 23 [2022-04-15 12:52:15,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772905982] [2022-04-15 12:52:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772905982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:15,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:15,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:52:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281378381] [2022-04-15 12:52:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 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 24 [2022-04-15 12:52:15,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:15,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:15,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:15,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:52:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:52:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:52:15,676 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:17,159 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-15 12:52:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:52:17,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 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 24 [2022-04-15 12:52:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-15 12:52:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-15 12:52:17,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 43 transitions. [2022-04-15 12:52:17,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:17,266 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:52:17,266 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:52:17,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:52:17,267 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:17,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:52:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-04-15 12:52:17,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:17,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,452 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,452 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:17,453 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 12:52:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 12:52:17,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:17,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:17,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:52:17,454 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:52:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:17,454 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 12:52:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 12:52:17,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:17,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:17,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:17,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-04-15 12:52:17,455 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 24 [2022-04-15 12:52:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:17,455 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-04-15 12:52:17,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:17,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 59 transitions. [2022-04-15 12:52:17,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 12:52:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:52:17,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:17,874 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:17,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:18,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:18,087 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1413378482, now seen corresponding path program 9 times [2022-04-15 12:52:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:18,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361103942] [2022-04-15 12:52:18,227 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash -620520429, now seen corresponding path program 1 times [2022-04-15 12:52:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:18,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007353002] [2022-04-15 12:52:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:18,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {5968#(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(10, 2);call #Ultimate.allocInit(12, 3); {5955#true} is VALID [2022-04-15 12:52:18,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-04-15 12:52:18,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5955#true} {5955#true} #72#return; {5955#true} is VALID [2022-04-15 12:52:18,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {5955#true} call ULTIMATE.init(); {5968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:18,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {5968#(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(10, 2);call #Ultimate.allocInit(12, 3); {5955#true} is VALID [2022-04-15 12:52:18,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5955#true} {5955#true} #72#return; {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {5955#true} call #t~ret13 := main(); {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {5955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {5955#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296))) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {5955#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5955#true} is VALID [2022-04-15 12:52:18,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {5955#true} ~z~0 := ~y~0; {5960#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:18,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5961#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:18,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5962#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:18,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5963#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:18,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:18,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:18,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:18,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:18,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#false} assume !(~x~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L272 TraceCheckUtils]: 20: Hoare triple {5956#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {5956#false} ~cond := #in~cond; {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {5956#false} assume 0 == ~cond; {5956#false} is VALID [2022-04-15 12:52:18,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-04-15 12:52:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007353002] [2022-04-15 12:52:18,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007353002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632581394] [2022-04-15 12:52:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:18,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:18,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:18,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:52:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:18,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:52:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:18,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:18,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {5955#true} call ULTIMATE.init(); {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#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(10, 2);call #Ultimate.allocInit(12, 3); {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5955#true} {5955#true} #72#return; {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {5955#true} call #t~ret13 := main(); {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {5955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {5955#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296))) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5955#true} is VALID [2022-04-15 12:52:18,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {5955#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5955#true} is VALID [2022-04-15 12:52:18,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {5955#true} ~z~0 := ~y~0; {5960#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:18,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5961#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:18,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5962#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:18,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5963#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:18,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:18,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:18,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:18,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:18,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:18,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:18,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5956#false} is VALID [2022-04-15 12:52:18,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#false} assume !(~x~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:18,803 INFO L272 TraceCheckUtils]: 20: Hoare triple {5956#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5956#false} is VALID [2022-04-15 12:52:18,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {5956#false} ~cond := #in~cond; {5956#false} is VALID [2022-04-15 12:52:18,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {5956#false} assume 0 == ~cond; {5956#false} is VALID [2022-04-15 12:52:18,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-04-15 12:52:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:18,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:19,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#false} assume !false; {5956#false} is VALID [2022-04-15 12:52:19,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {5956#false} assume 0 == ~cond; {5956#false} is VALID [2022-04-15 12:52:19,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {5956#false} ~cond := #in~cond; {5956#false} is VALID [2022-04-15 12:52:19,164 INFO L272 TraceCheckUtils]: 20: Hoare triple {5956#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5956#false} is VALID [2022-04-15 12:52:19,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#false} assume !(~x~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:19,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5956#false} is VALID [2022-04-15 12:52:19,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5956#false} is VALID [2022-04-15 12:52:19,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5967#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:19,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5966#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:19,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5965#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:19,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:19,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {6074#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5964#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:19,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {6078#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6074#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:52:19,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {6082#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6078#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:52:19,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {6086#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6082#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:52:19,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {5955#true} ~z~0 := ~y~0; {6086#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:52:19,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {5955#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5955#true} is VALID [2022-04-15 12:52:19,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {5955#true} [110] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_36) (+ v_main_~x~0_In_18 v_main_~y~0_In_15)) (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296))) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_15 v_main_~y~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {5955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {5955#true} call #t~ret13 := main(); {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5955#true} {5955#true} #72#return; {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {5955#true} assume true; {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {5955#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(10, 2);call #Ultimate.allocInit(12, 3); {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {5955#true} call ULTIMATE.init(); {5955#true} is VALID [2022-04-15 12:52:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:19,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632581394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:19,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:19,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 12:52:19,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:19,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361103942] [2022-04-15 12:52:19,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361103942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:19,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:19,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:52:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598982252] [2022-04-15 12:52:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:19,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2022-04-15 12:52:19,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:19,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:19,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:19,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:52:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:19,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:52:19,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:52:19,242 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:21,756 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-04-15 12:52:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:52:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2022-04-15 12:52:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2022-04-15 12:52:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2022-04-15 12:52:21,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 61 transitions. [2022-04-15 12:52:21,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:21,929 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:52:21,929 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:52:21,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:52:21,930 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:21,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 60 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:52:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:52:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-04-15 12:52:22,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:22,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:22,162 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:22,162 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:22,163 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 12:52:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 12:52:22,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:22,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:22,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:52:22,163 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:52:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:22,164 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 12:52:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 12:52:22,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:22,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:22,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:22,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-15 12:52:22,165 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 24 [2022-04-15 12:52:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:22,165 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-15 12:52:22,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:22,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-15 12:52:23,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 12:52:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:52:23,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:23,709 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:23,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:23,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 12:52:23,915 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1437562487, now seen corresponding path program 10 times [2022-04-15 12:52:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:23,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963480203] [2022-04-15 12:52:24,016 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -871882762, now seen corresponding path program 1 times [2022-04-15 12:52:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:24,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712139536] [2022-04-15 12:52:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:24,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {6558#(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(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:52:24,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:52:24,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6547#true} {6547#true} #72#return; {6547#true} is VALID [2022-04-15 12:52:24,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:24,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {6558#(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(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:52:24,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:52:24,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #72#return; {6547#true} is VALID [2022-04-15 12:52:24,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret13 := main(); {6547#true} is VALID [2022-04-15 12:52:24,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:52:24,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_16)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:52:24,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:24,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:24,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:52:24,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6557#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:52:24,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {6557#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6548#false} is VALID [2022-04-15 12:52:24,167 INFO L272 TraceCheckUtils]: 21: Hoare triple {6548#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6548#false} is VALID [2022-04-15 12:52:24,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#false} ~cond := #in~cond; {6548#false} is VALID [2022-04-15 12:52:24,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#false} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:52:24,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:52:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:52:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712139536] [2022-04-15 12:52:24,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712139536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920587900] [2022-04-15 12:52:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:24,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:24,169 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:24,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:52:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:24,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:52:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:24,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:24,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#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(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #72#return; {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret13 := main(); {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:52:24,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_16)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:52:24,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:24,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:52:24,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:52:24,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:24,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6548#false} is VALID [2022-04-15 12:52:24,462 INFO L272 TraceCheckUtils]: 21: Hoare triple {6548#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6548#false} is VALID [2022-04-15 12:52:24,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#false} ~cond := #in~cond; {6548#false} is VALID [2022-04-15 12:52:24,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#false} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:52:24,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:52:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:52:24,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:24,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:52:24,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {6548#false} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:52:24,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {6548#false} ~cond := #in~cond; {6548#false} is VALID [2022-04-15 12:52:24,736 INFO L272 TraceCheckUtils]: 21: Hoare triple {6548#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6548#false} is VALID [2022-04-15 12:52:24,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {6646#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6548#false} is VALID [2022-04-15 12:52:24,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {6646#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:52:24,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {6646#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6650#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:52:24,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {6675#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6646#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:52:24,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {6679#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6675#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 12:52:24,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {6683#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6679#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:52:24,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {6683#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {6683#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 12:52:24,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6683#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 12:52:24,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [112] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_32| 0) (= (+ v_main_~y~0_Out_32 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_16)) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_16 v_main_~y~0_Out_32))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:52:24,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret13 := main(); {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #72#return; {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#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(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6547#true} is VALID [2022-04-15 12:52:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 12:52:24,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920587900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:24,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:24,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-15 12:52:24,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:24,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963480203] [2022-04-15 12:52:24,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963480203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:24,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:24,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:52:24,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428977480] [2022-04-15 12:52:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:52:24,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:24,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:24,818 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-15 12:52:24,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:52:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:24,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:52:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:52:24,819 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:25,998 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-04-15 12:52:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:52:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:52:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-15 12:52:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-15 12:52:26,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2022-04-15 12:52:26,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:26,127 INFO L225 Difference]: With dead ends: 81 [2022-04-15 12:52:26,127 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:52:26,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:52:26,128 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:26,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 53 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:52:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2022-04-15 12:52:26,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:26,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,397 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,398 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:26,398 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-15 12:52:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-15 12:52:26,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:26,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:26,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:52:26,399 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:52:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:26,400 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-15 12:52:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-15 12:52:26,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:26,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:26,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:26,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.271186440677966) internal successors, (75), 59 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-04-15 12:52:26,401 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 25 [2022-04-15 12:52:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:26,401 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-04-15 12:52:26,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:26,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 79 transitions. [2022-04-15 12:52:29,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 78 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-04-15 12:52:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:52:29,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:29,256 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:29,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 12:52:29,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:29,456 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1940208440, now seen corresponding path program 11 times [2022-04-15 12:52:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345862198] [2022-04-15 12:52:29,595 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 387606274, now seen corresponding path program 1 times [2022-04-15 12:52:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489571453] [2022-04-15 12:52:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:29,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {7180#(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(10, 2);call #Ultimate.allocInit(12, 3); {7169#true} is VALID [2022-04-15 12:52:29,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {7169#true} assume true; {7169#true} is VALID [2022-04-15 12:52:29,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7169#true} {7169#true} #72#return; {7169#true} is VALID [2022-04-15 12:52:29,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {7169#true} call ULTIMATE.init(); {7180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:29,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {7180#(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(10, 2);call #Ultimate.allocInit(12, 3); {7169#true} is VALID [2022-04-15 12:52:29,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {7169#true} assume true; {7169#true} is VALID [2022-04-15 12:52:29,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7169#true} {7169#true} #72#return; {7169#true} is VALID [2022-04-15 12:52:29,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {7169#true} call #t~ret13 := main(); {7169#true} is VALID [2022-04-15 12:52:29,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {7169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7169#true} is VALID [2022-04-15 12:52:29,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {7169#true} [114] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7169#true} is VALID [2022-04-15 12:52:29,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {7169#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7169#true} is VALID [2022-04-15 12:52:29,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {7169#true} ~z~0 := ~y~0; {7174#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:29,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7175#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:29,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {7175#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7176#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:29,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {7176#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7177#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:29,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {7177#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:29,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:29,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {7170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {7170#false} assume !(~y~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {7170#false} assume !(~x~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L272 TraceCheckUtils]: 20: Hoare triple {7170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {7170#false} ~cond := #in~cond; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {7170#false} assume 0 == ~cond; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {7170#false} assume !false; {7170#false} is VALID [2022-04-15 12:52:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:52:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:29,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489571453] [2022-04-15 12:52:29,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489571453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:29,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775720850] [2022-04-15 12:52:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:29,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:29,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:52:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:29,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:52:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:29,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:30,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {7169#true} call ULTIMATE.init(); {7169#true} is VALID [2022-04-15 12:52:30,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {7169#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(10, 2);call #Ultimate.allocInit(12, 3); {7169#true} is VALID [2022-04-15 12:52:30,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {7169#true} assume true; {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7169#true} {7169#true} #72#return; {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {7169#true} call #t~ret13 := main(); {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {7169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {7169#true} [114] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {7169#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7169#true} is VALID [2022-04-15 12:52:30,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {7169#true} ~z~0 := ~y~0; {7174#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:30,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7175#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:30,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {7175#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7176#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:30,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {7176#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7217#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:30,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {7217#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:30,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:30,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:30,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {7170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {7170#false} assume !(~y~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {7170#false} assume !(~x~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L272 TraceCheckUtils]: 20: Hoare triple {7170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {7170#false} ~cond := #in~cond; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {7170#false} assume 0 == ~cond; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {7170#false} assume !false; {7170#false} is VALID [2022-04-15 12:52:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:52:30,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {7170#false} assume !false; {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {7170#false} assume 0 == ~cond; {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {7170#false} ~cond := #in~cond; {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L272 TraceCheckUtils]: 20: Hoare triple {7170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {7170#false} assume !(~x~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {7170#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7170#false} is VALID [2022-04-15 12:52:30,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {7170#false} assume !(~y~0 % 4294967296 > 0); {7170#false} is VALID [2022-04-15 12:52:30,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {7170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:30,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7170#false} is VALID [2022-04-15 12:52:30,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7179#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:52:30,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {7217#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7178#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:52:30,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {7290#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7217#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-15 12:52:30,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {7294#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7290#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:52:30,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {7298#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7294#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:52:30,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {7169#true} ~z~0 := ~y~0; {7298#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-15 12:52:30,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {7169#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7169#true} is VALID [2022-04-15 12:52:30,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {7169#true} [114] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_40) (+ v_main_~x~0_In_20 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20) (= |v_main_#t~post5_Out_34| 0))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7169#true} is VALID [2022-04-15 12:52:30,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {7169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7169#true} is VALID [2022-04-15 12:52:30,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {7169#true} call #t~ret13 := main(); {7169#true} is VALID [2022-04-15 12:52:30,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7169#true} {7169#true} #72#return; {7169#true} is VALID [2022-04-15 12:52:30,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {7169#true} assume true; {7169#true} is VALID [2022-04-15 12:52:30,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {7169#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(10, 2);call #Ultimate.allocInit(12, 3); {7169#true} is VALID [2022-04-15 12:52:30,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {7169#true} call ULTIMATE.init(); {7169#true} is VALID [2022-04-15 12:52:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:52:30,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775720850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:30,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:30,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-15 12:52:30,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:30,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345862198] [2022-04-15 12:52:30,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345862198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:30,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:30,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:52:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166443280] [2022-04-15 12:52:30,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 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-15 12:52:30,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:30,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:30,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:30,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:52:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:52:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:52:30,750 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:32,121 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-15 12:52:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:52:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 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-15 12:52:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 12:52:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 46 transitions. [2022-04-15 12:52:32,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 46 transitions. [2022-04-15 12:52:32,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:32,204 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:52:32,204 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:52:32,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:52:32,205 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:32,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:52:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:52:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-04-15 12:52:32,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:32,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,424 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,424 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:32,425 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-15 12:52:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 12:52:32,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:32,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:32,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:52:32,425 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:52:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:32,426 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-15 12:52:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 12:52:32,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:32,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:32,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-15 12:52:32,427 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 25 [2022-04-15 12:52:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:32,427 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-15 12:52:32,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:32,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-15 12:52:33,098 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-15 12:52:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-15 12:52:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:52:33,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:33,099 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:33,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:33,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:33,315 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 534464216, now seen corresponding path program 12 times [2022-04-15 12:52:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:33,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053435601] [2022-04-15 12:52:33,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash 625809506, now seen corresponding path program 1 times [2022-04-15 12:52:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556258938] [2022-04-15 12:52:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:33,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {7801#(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(10, 2);call #Ultimate.allocInit(12, 3); {7786#true} is VALID [2022-04-15 12:52:33,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {7786#true} assume true; {7786#true} is VALID [2022-04-15 12:52:33,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7786#true} {7786#true} #72#return; {7786#true} is VALID [2022-04-15 12:52:33,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {7786#true} call ULTIMATE.init(); {7801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:33,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {7801#(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(10, 2);call #Ultimate.allocInit(12, 3); {7786#true} is VALID [2022-04-15 12:52:33,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {7786#true} assume true; {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7786#true} {7786#true} #72#return; {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {7786#true} call #t~ret13 := main(); {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {7786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {7786#true} [116] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_18 v_main_~y~0_Out_36) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_42)) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {7786#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7786#true} is VALID [2022-04-15 12:52:33,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {7786#true} ~z~0 := ~y~0; {7791#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:33,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {7791#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:33,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {7792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:33,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {7793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:33,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {7794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:52:33,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {7795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:33,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:33,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:33,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:33,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:33,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {7787#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {7787#false} assume !(~x~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L272 TraceCheckUtils]: 22: Hoare triple {7787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {7787#false} ~cond := #in~cond; {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {7787#false} assume 0 == ~cond; {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {7787#false} assume !false; {7787#false} is VALID [2022-04-15 12:52:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:33,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556258938] [2022-04-15 12:52:33,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556258938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:33,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894658604] [2022-04-15 12:52:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:33,711 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:52:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:33,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:52:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:33,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:34,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {7786#true} call ULTIMATE.init(); {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {7786#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(10, 2);call #Ultimate.allocInit(12, 3); {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {7786#true} assume true; {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7786#true} {7786#true} #72#return; {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {7786#true} call #t~ret13 := main(); {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {7786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {7786#true} [116] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_18 v_main_~y~0_Out_36) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_42)) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7786#true} is VALID [2022-04-15 12:52:34,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {7786#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7786#true} is VALID [2022-04-15 12:52:34,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {7786#true} ~z~0 := ~y~0; {7791#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:52:34,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {7791#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:34,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {7792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:34,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {7793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:34,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {7794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:52:34,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {7795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:34,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:34,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:34,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:34,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:34,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:34,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:34,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {7787#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {7787#false} assume !(~x~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L272 TraceCheckUtils]: 22: Hoare triple {7787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {7787#false} ~cond := #in~cond; {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {7787#false} assume 0 == ~cond; {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {7787#false} assume !false; {7787#false} is VALID [2022-04-15 12:52:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:34,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:34,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {7787#false} assume !false; {7787#false} is VALID [2022-04-15 12:52:34,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {7787#false} assume 0 == ~cond; {7787#false} is VALID [2022-04-15 12:52:34,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {7787#false} ~cond := #in~cond; {7787#false} is VALID [2022-04-15 12:52:34,613 INFO L272 TraceCheckUtils]: 22: Hoare triple {7787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {7787#false} is VALID [2022-04-15 12:52:34,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {7787#false} assume !(~x~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:34,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {7787#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {7787#false} is VALID [2022-04-15 12:52:34,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7787#false} is VALID [2022-04-15 12:52:34,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:34,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:34,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:34,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:34,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:34,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {7916#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:34,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7920#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7916#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:52:34,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {7924#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7920#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 12:52:34,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {7928#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7924#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:52:34,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {7932#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7928#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:52:34,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {7786#true} ~z~0 := ~y~0; {7932#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:34,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {7786#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7786#true} is VALID [2022-04-15 12:52:34,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {7786#true} [116] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_18 v_main_~y~0_Out_36) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_21 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_42)) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= |v_main_#t~post6_Out_36| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7786#true} is VALID [2022-04-15 12:52:34,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {7786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7786#true} is VALID [2022-04-15 12:52:34,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {7786#true} call #t~ret13 := main(); {7786#true} is VALID [2022-04-15 12:52:34,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7786#true} {7786#true} #72#return; {7786#true} is VALID [2022-04-15 12:52:34,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {7786#true} assume true; {7786#true} is VALID [2022-04-15 12:52:34,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {7786#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(10, 2);call #Ultimate.allocInit(12, 3); {7786#true} is VALID [2022-04-15 12:52:34,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {7786#true} call ULTIMATE.init(); {7786#true} is VALID [2022-04-15 12:52:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:52:34,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894658604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:34,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:34,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:52:34,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:34,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053435601] [2022-04-15 12:52:34,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053435601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:34,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:34,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:52:34,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449600179] [2022-04-15 12:52:34,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-15 12:52:34,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:34,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:34,769 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-15 12:52:34,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:52:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:52:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:52:34,770 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:39,900 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-04-15 12:52:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:52:39,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-15 12:52:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-15 12:52:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-15 12:52:39,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 71 transitions. [2022-04-15 12:52:40,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:40,278 INFO L225 Difference]: With dead ends: 87 [2022-04-15 12:52:40,278 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 12:52:40,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=456, Invalid=2094, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:52:40,280 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:40,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 69 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:52:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 12:52:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-04-15 12:52:40,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:40,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,565 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,565 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,566 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-04-15 12:52:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-04-15 12:52:40,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:40,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:40,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 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 70 states. [2022-04-15 12:52:40,566 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 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 70 states. [2022-04-15 12:52:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,567 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-04-15 12:52:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-04-15 12:52:40,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:40,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:40,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:40,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-15 12:52:40,568 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 27 [2022-04-15 12:52:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:40,568 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2022-04-15 12:52:40,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-15 12:52:41,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-04-15 12:52:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:52:41,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:41,486 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:41,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:52:41,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 12:52:41,687 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 13 times [2022-04-15 12:52:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:41,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484227453] [2022-04-15 12:52:41,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1102700057, now seen corresponding path program 1 times [2022-04-15 12:52:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400724359] [2022-04-15 12:52:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:42,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:42,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {8497#(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(10, 2);call #Ultimate.allocInit(12, 3); {8476#true} is VALID [2022-04-15 12:52:42,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {8476#true} assume true; {8476#true} is VALID [2022-04-15 12:52:42,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8476#true} {8476#true} #72#return; {8476#true} is VALID [2022-04-15 12:52:42,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {8476#true} call ULTIMATE.init(); {8497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:42,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {8497#(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(10, 2);call #Ultimate.allocInit(12, 3); {8476#true} is VALID [2022-04-15 12:52:42,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {8476#true} assume true; {8476#true} is VALID [2022-04-15 12:52:42,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8476#true} {8476#true} #72#return; {8476#true} is VALID [2022-04-15 12:52:42,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {8476#true} call #t~ret13 := main(); {8476#true} is VALID [2022-04-15 12:52:42,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {8476#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8481#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:42,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {8481#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [118] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_44) (+ v_main_~x~0_In_22 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8482#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:52:42,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {8482#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8483#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:52:42,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {8483#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {8484#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-15 12:52:42,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {8484#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8485#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1)))} is VALID [2022-04-15 12:52:42,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {8485#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8486#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648))))} is VALID [2022-04-15 12:52:42,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {8486#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8487#(and (not (= main_~y~0 0)) (or (<= (+ 2147483645 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 2147483648) main_~z~0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 2147483648)))))} is VALID [2022-04-15 12:52:42,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {8487#(and (not (= main_~y~0 0)) (or (<= (+ 2147483645 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 2147483648) main_~z~0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 2147483648)))))} assume !(~z~0 % 4294967296 > 0); {8488#(and (not (= main_~y~0 0)) (<= (div (* main_~n~0 2) 4294967296) (+ (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) (div main_~z~0 4294967296))) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:42,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {8488#(and (not (= main_~y~0 0)) (<= (div (* main_~n~0 2) 4294967296) (+ (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) (div main_~z~0 4294967296))) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8489#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)) (<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:52:42,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {8489#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)) (<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8490#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} is VALID [2022-04-15 12:52:42,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {8490#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8491#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:42,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {8491#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8491#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:42,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {8491#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8492#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:52:42,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {8492#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8493#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:52:42,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {8493#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:42,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:42,692 INFO L272 TraceCheckUtils]: 21: Hoare triple {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8495#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:52:42,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8496#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:52:42,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {8496#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8477#false} is VALID [2022-04-15 12:52:42,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {8477#false} assume !false; {8477#false} is VALID [2022-04-15 12:52:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:42,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400724359] [2022-04-15 12:52:42,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400724359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:42,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619805419] [2022-04-15 12:52:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:42,694 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:42,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:52:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:42,847 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:52:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:42,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:59,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {8476#true} call ULTIMATE.init(); {8476#true} is VALID [2022-04-15 12:52:59,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {8476#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(10, 2);call #Ultimate.allocInit(12, 3); {8476#true} is VALID [2022-04-15 12:52:59,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {8476#true} assume true; {8476#true} is VALID [2022-04-15 12:52:59,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8476#true} {8476#true} #72#return; {8476#true} is VALID [2022-04-15 12:52:59,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {8476#true} call #t~ret13 := main(); {8476#true} is VALID [2022-04-15 12:53:00,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {8476#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8481#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:53:00,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {8481#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [118] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_44) (+ v_main_~x~0_In_22 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8519#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:53:00,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8523#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:53:00,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {8523#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {8527#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:53:00,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8531#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:00,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {8531#(and (= main_~n~0 (+ (- 1) main_~y~0 main_~x~0)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (<= main_~x~0 (+ main_~n~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8535#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:00,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {8535#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8539#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 3)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:00,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))) (= main_~y~0 (+ main_~z~0 3)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8543#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 3) (+ main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:53:00,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {8543#(and (<= 0 main_~y~0) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 3) (+ main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8547#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:53:00,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {8547#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8551#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 3)) (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:53:00,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {8551#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 3)) (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8555#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ (- 1) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)))} is VALID [2022-04-15 12:53:00,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {8555#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ (- 1) main_~z~0) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {8559#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:53:00,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {8559#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8563#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:53:00,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8567#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:53:00,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {8567#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= 2 main_~z~0) (<= (mod (+ main_~n~0 2 (* main_~z~0 4294967295)) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8571#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= 3 main_~z~0) (<= (mod (+ main_~n~0 3 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 12:53:00,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {8571#(and (= (+ main_~z~0 main_~x~0) (+ main_~n~0 3)) (<= 3 main_~z~0) (<= (mod (+ main_~n~0 3 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {8575#(and (<= 3 main_~z~0) (<= (mod (+ main_~n~0 3 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 12:53:00,037 INFO L272 TraceCheckUtils]: 21: Hoare triple {8575#(and (<= 3 main_~z~0) (<= (mod (+ main_~n~0 3 (* main_~z~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:00,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {8579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:53:00,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {8583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8477#false} is VALID [2022-04-15 12:53:00,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {8477#false} assume !false; {8477#false} is VALID [2022-04-15 12:53:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:00,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:35,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {8477#false} assume !false; {8477#false} is VALID [2022-04-15 12:53:35,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {8583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8477#false} is VALID [2022-04-15 12:53:35,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {8579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:53:35,966 INFO L272 TraceCheckUtils]: 21: Hoare triple {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:35,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {8602#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {8494#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:53:35,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {8606#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8602#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:35,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {8610#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8606#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-15 12:53:35,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {8614#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8610#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:53:35,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {8618#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8614#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:53:35,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {8622#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8618#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:53:35,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {8626#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8622#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-15 12:53:35,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {8630#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8626#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:53:35,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {8634#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8630#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {8638#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8634#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {8642#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8638#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:53:36,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {8646#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8642#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {8650#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {8646#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {8650#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8650#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {8657#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (div (+ (- 4) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) (div (+ main_~y~0 main_~x~0 (- 4294967293)) 4294967296) 3 (div (+ (- 4294967290) (* (- 2) main_~n~0)) 4294967296)))) (or (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* main_~n~0 2) (- 3) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967293)) 4294967296) 1)) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2))))} [118] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_44) (+ v_main_~x~0_In_22 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8650#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:53:36,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {8476#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8657#(and (or (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2)) (<= (div (+ (- 4) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) (div (+ main_~y~0 main_~x~0 (- 4294967293)) 4294967296) 3 (div (+ (- 4294967290) (* (- 2) main_~n~0)) 4294967296)))) (or (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* main_~n~0 2) (- 3) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (+ (div (+ main_~y~0 main_~x~0 (- 4294967293)) 4294967296) 1)) (< (div (+ (* (- 1) main_~x~0) (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0 main_~x~0) 4294967296) 2))))} is VALID [2022-04-15 12:53:36,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {8476#true} call #t~ret13 := main(); {8476#true} is VALID [2022-04-15 12:53:36,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8476#true} {8476#true} #72#return; {8476#true} is VALID [2022-04-15 12:53:36,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {8476#true} assume true; {8476#true} is VALID [2022-04-15 12:53:36,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {8476#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(10, 2);call #Ultimate.allocInit(12, 3); {8476#true} is VALID [2022-04-15 12:53:36,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {8476#true} call ULTIMATE.init(); {8476#true} is VALID [2022-04-15 12:53:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:36,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619805419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:36,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:36,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 50 [2022-04-15 12:53:38,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:38,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484227453] [2022-04-15 12:53:38,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484227453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:38,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:38,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:53:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181865807] [2022-04-15 12:53:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-15 12:53:38,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:38,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:38,770 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-15 12:53:38,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:53:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:53:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=2448, Unknown=3, NotChecked=0, Total=2862 [2022-04-15 12:53:38,773 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,238 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-15 12:53:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:53:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-15 12:53:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 12:53:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 12:53:50,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions. [2022-04-15 12:53:50,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:50,427 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:53:50,427 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:53:50,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=664, Invalid=4735, Unknown=3, NotChecked=0, Total=5402 [2022-04-15 12:53:50,429 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:50,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:53:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:53:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-04-15 12:53:50,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:50,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,735 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,735 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,736 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-04-15 12:53:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-04-15 12:53:50,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:50,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:50,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:53:50,736 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:53:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:50,737 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-04-15 12:53:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-04-15 12:53:50,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:50,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:50,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:50,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-15 12:53:50,738 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 27 [2022-04-15 12:53:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:50,738 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-15 12:53:50,738 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:50,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-15 12:53:54,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 78 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 12:53:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:53:54,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:54,772 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:54,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:54,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:54,972 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash -38975983, now seen corresponding path program 14 times [2022-04-15 12:53:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792437492] [2022-04-15 12:53:55,125 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2002834759, now seen corresponding path program 1 times [2022-04-15 12:53:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753873138] [2022-04-15 12:53:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:55,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {9168#(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(10, 2);call #Ultimate.allocInit(12, 3); {9156#true} is VALID [2022-04-15 12:53:55,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {9156#true} assume true; {9156#true} is VALID [2022-04-15 12:53:55,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9156#true} {9156#true} #72#return; {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {9156#true} call ULTIMATE.init(); {9168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:55,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9168#(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(10, 2);call #Ultimate.allocInit(12, 3); {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {9156#true} assume true; {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9156#true} {9156#true} #72#return; {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {9156#true} call #t~ret13 := main(); {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {9156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9156#true} is VALID [2022-04-15 12:53:55,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {9156#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_40| 0) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_46)) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9156#true} is VALID [2022-04-15 12:53:55,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {9156#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:55,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:55,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9162#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:53:55,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {9162#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9163#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {9163#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9164#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {9164#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9167#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:53:55,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {9167#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {9157#false} is VALID [2022-04-15 12:53:55,344 INFO L272 TraceCheckUtils]: 23: Hoare triple {9157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9157#false} is VALID [2022-04-15 12:53:55,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#false} ~cond := #in~cond; {9157#false} is VALID [2022-04-15 12:53:55,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {9157#false} assume 0 == ~cond; {9157#false} is VALID [2022-04-15 12:53:55,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {9157#false} assume !false; {9157#false} is VALID [2022-04-15 12:53:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:53:55,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753873138] [2022-04-15 12:53:55,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753873138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33111803] [2022-04-15 12:53:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:55,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:55,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:55,346 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:53:55,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:53:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:55,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:53:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:55,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:55,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {9156#true} call ULTIMATE.init(); {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {9156#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(10, 2);call #Ultimate.allocInit(12, 3); {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {9156#true} assume true; {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9156#true} {9156#true} #72#return; {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {9156#true} call #t~ret13 := main(); {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {9156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9156#true} is VALID [2022-04-15 12:53:55,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {9156#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_40| 0) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_46)) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9156#true} is VALID [2022-04-15 12:53:55,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {9156#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:55,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:55,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {9161#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9162#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:53:55,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {9162#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9163#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {9163#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9164#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {9164#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:55,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {9166#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:55,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {9165#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9157#false} is VALID [2022-04-15 12:53:55,678 INFO L272 TraceCheckUtils]: 23: Hoare triple {9157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9157#false} is VALID [2022-04-15 12:53:55,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#false} ~cond := #in~cond; {9157#false} is VALID [2022-04-15 12:53:55,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {9157#false} assume 0 == ~cond; {9157#false} is VALID [2022-04-15 12:53:55,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {9157#false} assume !false; {9157#false} is VALID [2022-04-15 12:53:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:53:55,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:56,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {9157#false} assume !false; {9157#false} is VALID [2022-04-15 12:53:56,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {9157#false} assume 0 == ~cond; {9157#false} is VALID [2022-04-15 12:53:56,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#false} ~cond := #in~cond; {9157#false} is VALID [2022-04-15 12:53:56,075 INFO L272 TraceCheckUtils]: 23: Hoare triple {9157#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9157#false} is VALID [2022-04-15 12:53:56,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {9262#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9157#false} is VALID [2022-04-15 12:53:56,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9262#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:53:56,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {9262#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9266#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:53:56,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {9294#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9262#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:53:56,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {9298#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9294#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 12:53:56,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {9302#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9298#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:53:56,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {9306#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9302#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 12:53:56,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {9306#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {9306#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 12:53:56,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {9156#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9306#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 12:53:56,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {9156#true} [120] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_23 v_main_~x~0_Out_46) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) (and (= |v_main_#t~post5_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= |v_main_#t~post6_Out_40| 0) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_46)) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {9156#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {9156#true} call #t~ret13 := main(); {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9156#true} {9156#true} #72#return; {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {9156#true} assume true; {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {9156#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(10, 2);call #Ultimate.allocInit(12, 3); {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {9156#true} call ULTIMATE.init(); {9156#true} is VALID [2022-04-15 12:53:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 12:53:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33111803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:56,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-15 12:53:56,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:56,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792437492] [2022-04-15 12:53:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792437492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:56,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:56,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:53:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114359774] [2022-04-15 12:53:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:53:56,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:56,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:56,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:56,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:53:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:53:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:53:56,216 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:58,298 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2022-04-15 12:53:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:53:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:53:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2022-04-15 12:53:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2022-04-15 12:53:58,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 74 transitions. [2022-04-15 12:53:58,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:58,536 INFO L225 Difference]: With dead ends: 102 [2022-04-15 12:53:58,536 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 12:53:58,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:53:58,537 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:58,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:53:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 12:53:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2022-04-15 12:53:58,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:58,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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-15 12:53:58,901 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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-15 12:53:58,901 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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-15 12:53:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:58,902 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-15 12:53:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-04-15 12:53:58,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:58,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:58,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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 96 states. [2022-04-15 12:53:58,903 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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 96 states. [2022-04-15 12:53:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:58,904 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-15 12:53:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-04-15 12:53:58,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:58,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:58,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:58,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 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-15 12:53:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2022-04-15 12:53:58,907 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 28 [2022-04-15 12:53:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:58,907 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2022-04-15 12:53:58,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:58,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 91 transitions. [2022-04-15 12:54:02,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2022-04-15 12:54:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:54:02,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:02,277 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:02,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 12:54:02,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:02,478 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2127598423, now seen corresponding path program 15 times [2022-04-15 12:54:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:02,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006261648] [2022-04-15 12:54:02,627 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1680548979, now seen corresponding path program 1 times [2022-04-15 12:54:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:02,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480207749] [2022-04-15 12:54:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:03,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {9922#(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(10, 2);call #Ultimate.allocInit(12, 3); {9905#true} is VALID [2022-04-15 12:54:03,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {9905#true} assume true; {9905#true} is VALID [2022-04-15 12:54:03,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9905#true} {9905#true} #72#return; {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {9905#true} call ULTIMATE.init(); {9922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:03,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {9922#(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(10, 2);call #Ultimate.allocInit(12, 3); {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {9905#true} assume true; {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9905#true} {9905#true} #72#return; {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {9905#true} call #t~ret13 := main(); {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {9905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {9905#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_24 v_main_~x~0_Out_48)) (and (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_48) (+ v_main_~x~0_In_24 v_main_~y~0_In_21)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9905#true} is VALID [2022-04-15 12:54:03,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {9905#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9905#true} is VALID [2022-04-15 12:54:03,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {9905#true} ~z~0 := ~y~0; {9910#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:54:03,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {9910#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9911#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:03,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {9911#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9912#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:03,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {9912#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9913#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:03,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {9913#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9914#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:54:03,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {9914#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9915#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:03,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {9915#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:03,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:03,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:54:03,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:54:03,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:54:03,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:03,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:54:03,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {9906#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {9906#false} assume !(~x~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L272 TraceCheckUtils]: 24: Hoare triple {9906#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {9906#false} ~cond := #in~cond; {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {9906#false} assume 0 == ~cond; {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {9906#false} assume !false; {9906#false} is VALID [2022-04-15 12:54:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:54:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480207749] [2022-04-15 12:54:03,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480207749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:03,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820895417] [2022-04-15 12:54:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:03,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:03,032 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:54:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:03,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:54:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:03,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:03,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {9905#true} call ULTIMATE.init(); {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {9905#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(10, 2);call #Ultimate.allocInit(12, 3); {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {9905#true} assume true; {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9905#true} {9905#true} #72#return; {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {9905#true} call #t~ret13 := main(); {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {9905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {9905#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_24 v_main_~x~0_Out_48)) (and (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_48) (+ v_main_~x~0_In_24 v_main_~y~0_In_21)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9905#true} is VALID [2022-04-15 12:54:03,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {9905#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9905#true} is VALID [2022-04-15 12:54:03,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {9905#true} ~z~0 := ~y~0; {9910#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:54:03,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {9910#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9911#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:03,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {9911#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9912#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:03,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {9912#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9913#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:03,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {9913#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9914#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:54:03,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {9914#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9915#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:03,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {9915#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9968#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:54:03,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {9968#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {9968#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:54:03,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {9968#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:54:03,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:54:03,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:54:03,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:03,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {9906#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {9906#false} assume !(~x~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L272 TraceCheckUtils]: 24: Hoare triple {9906#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {9906#false} ~cond := #in~cond; {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {9906#false} assume 0 == ~cond; {9906#false} is VALID [2022-04-15 12:54:03,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {9906#false} assume !false; {9906#false} is VALID [2022-04-15 12:54:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:54:03,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:04,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {9906#false} assume !false; {9906#false} is VALID [2022-04-15 12:54:04,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {9906#false} assume 0 == ~cond; {9906#false} is VALID [2022-04-15 12:54:04,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {9906#false} ~cond := #in~cond; {9906#false} is VALID [2022-04-15 12:54:04,282 INFO L272 TraceCheckUtils]: 24: Hoare triple {9906#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {9906#false} is VALID [2022-04-15 12:54:04,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {9906#false} assume !(~x~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:04,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {9906#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {9906#false} is VALID [2022-04-15 12:54:04,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9906#false} is VALID [2022-04-15 12:54:04,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:54:04,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:54:04,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:54:04,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:54:04,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:54:04,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:04,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {10047#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:04,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {10051#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10047#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:54:04,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {10055#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10051#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:54:04,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {10059#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10055#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 12:54:04,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {10063#(or (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10059#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:54:04,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {10067#(or (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10063#(or (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:54:04,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {9905#true} ~z~0 := ~y~0; {10067#(or (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:54:04,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {9905#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9905#true} is VALID [2022-04-15 12:54:04,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {9905#true} [122] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_24 v_main_~x~0_Out_48)) (and (= (+ v_main_~y~0_Out_42 v_main_~x~0_Out_48) (+ v_main_~x~0_In_24 v_main_~y~0_In_21)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {9905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {9905#true} call #t~ret13 := main(); {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9905#true} {9905#true} #72#return; {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {9905#true} assume true; {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9905#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(10, 2);call #Ultimate.allocInit(12, 3); {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {9905#true} call ULTIMATE.init(); {9905#true} is VALID [2022-04-15 12:54:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:54:04,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820895417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:04,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:04,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2022-04-15 12:54:04,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006261648] [2022-04-15 12:54:04,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006261648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:04,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:04,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:54:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720124479] [2022-04-15 12:54:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 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 29 [2022-04-15 12:54:04,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:04,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:04,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:04,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:54:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:54:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:54:04,551 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:17,337 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-04-15 12:54:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 12:54:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 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 29 [2022-04-15 12:54:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 90 transitions. [2022-04-15 12:54:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 90 transitions. [2022-04-15 12:54:17,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 90 transitions. [2022-04-15 12:54:18,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:18,010 INFO L225 Difference]: With dead ends: 113 [2022-04-15 12:54:18,010 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:54:18,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=758, Invalid=3798, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 12:54:18,012 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:18,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 12:54:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:54:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2022-04-15 12:54:18,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:18,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:18,469 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:18,469 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:18,470 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 12:54:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 12:54:18,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:18,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:18,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:54:18,471 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:54:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:18,472 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 12:54:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 12:54:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:18,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:18,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:18,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-04-15 12:54:18,473 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 29 [2022-04-15 12:54:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:18,473 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-04-15 12:54:18,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:18,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 108 transitions. [2022-04-15 12:54:24,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 107 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-15 12:54:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:54:24,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:24,926 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:24,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:54:25,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:25,126 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash -958539168, now seen corresponding path program 16 times [2022-04-15 12:54:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577602832] [2022-04-15 12:54:25,279 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -456670314, now seen corresponding path program 1 times [2022-04-15 12:54:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226519389] [2022-04-15 12:54:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:25,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {10795#(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(10, 2);call #Ultimate.allocInit(12, 3); {10782#true} is VALID [2022-04-15 12:54:25,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {10782#true} assume true; {10782#true} is VALID [2022-04-15 12:54:25,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10782#true} {10782#true} #72#return; {10782#true} is VALID [2022-04-15 12:54:25,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {10782#true} call ULTIMATE.init(); {10795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:25,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {10795#(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(10, 2);call #Ultimate.allocInit(12, 3); {10782#true} is VALID [2022-04-15 12:54:25,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {10782#true} assume true; {10782#true} is VALID [2022-04-15 12:54:25,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10782#true} {10782#true} #72#return; {10782#true} is VALID [2022-04-15 12:54:25,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {10782#true} call #t~ret13 := main(); {10782#true} is VALID [2022-04-15 12:54:25,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {10782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10782#true} is VALID [2022-04-15 12:54:25,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {10782#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_50))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10782#true} is VALID [2022-04-15 12:54:25,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {10782#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:25,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:25,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10788#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:25,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {10788#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10789#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {10789#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10790#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {10790#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10791#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {10791#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:25,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:25,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10794#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:54:25,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {10794#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10783#false} is VALID [2022-04-15 12:54:25,675 INFO L272 TraceCheckUtils]: 25: Hoare triple {10783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10783#false} is VALID [2022-04-15 12:54:25,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {10783#false} ~cond := #in~cond; {10783#false} is VALID [2022-04-15 12:54:25,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {10783#false} assume 0 == ~cond; {10783#false} is VALID [2022-04-15 12:54:25,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {10783#false} assume !false; {10783#false} is VALID [2022-04-15 12:54:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 12:54:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226519389] [2022-04-15 12:54:25,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226519389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351508586] [2022-04-15 12:54:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:25,677 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:25,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:54:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:25,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:54:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:25,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:26,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {10782#true} call ULTIMATE.init(); {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {10782#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(10, 2);call #Ultimate.allocInit(12, 3); {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {10782#true} assume true; {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10782#true} {10782#true} #72#return; {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {10782#true} call #t~ret13 := main(); {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {10782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10782#true} is VALID [2022-04-15 12:54:26,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {10782#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_50))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10782#true} is VALID [2022-04-15 12:54:26,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {10782#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:26,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:26,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {10787#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10788#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:26,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {10788#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10789#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {10789#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10790#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {10790#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10791#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {10791#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:26,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:26,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {10793#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:26,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {10792#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~x~0 % 4294967296 > 0); {10783#false} is VALID [2022-04-15 12:54:26,073 INFO L272 TraceCheckUtils]: 25: Hoare triple {10783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10783#false} is VALID [2022-04-15 12:54:26,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {10783#false} ~cond := #in~cond; {10783#false} is VALID [2022-04-15 12:54:26,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {10783#false} assume 0 == ~cond; {10783#false} is VALID [2022-04-15 12:54:26,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {10783#false} assume !false; {10783#false} is VALID [2022-04-15 12:54:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 12:54:26,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:26,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {10783#false} assume !false; {10783#false} is VALID [2022-04-15 12:54:26,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {10783#false} assume 0 == ~cond; {10783#false} is VALID [2022-04-15 12:54:26,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {10783#false} ~cond := #in~cond; {10783#false} is VALID [2022-04-15 12:54:26,609 INFO L272 TraceCheckUtils]: 25: Hoare triple {10783#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10783#false} is VALID [2022-04-15 12:54:26,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {10895#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10783#false} is VALID [2022-04-15 12:54:26,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10895#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:54:26,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {10895#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10899#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:54:26,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {10930#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10895#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:54:26,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {10934#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10930#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 12:54:26,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {10938#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10934#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:54:26,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {10942#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10938#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 12:54:26,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {10946#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10942#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 12:54:26,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {10946#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {10946#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 12:54:26,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {10782#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10946#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 12:54:26,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {10782#true} [124] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_50))) (and (= v_main_~y~0_In_22 v_main_~y~0_Out_44) (= v_main_~x~0_In_25 v_main_~x~0_Out_50))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {10782#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {10782#true} call #t~ret13 := main(); {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10782#true} {10782#true} #72#return; {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {10782#true} assume true; {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {10782#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(10, 2);call #Ultimate.allocInit(12, 3); {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {10782#true} call ULTIMATE.init(); {10782#true} is VALID [2022-04-15 12:54:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 12:54:26,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351508586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:26,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:26,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-04-15 12:54:26,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577602832] [2022-04-15 12:54:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577602832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:26,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:26,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:54:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741163996] [2022-04-15 12:54:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:26,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:54:26,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:26,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:26,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:26,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:54:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:26,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:54:26,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:54:26,833 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:30,243 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2022-04-15 12:54:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:54:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:54:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-15 12:54:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-15 12:54:30,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2022-04-15 12:54:30,556 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-15 12:54:30,558 INFO L225 Difference]: With dead ends: 127 [2022-04-15 12:54:30,558 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 12:54:30,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:54:30,558 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:30,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 41 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:54:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 12:54:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2022-04-15 12:54:31,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:31,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:31,065 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:31,065 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:31,070 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2022-04-15 12:54:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-04-15 12:54:31,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:31,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:31,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 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 121 states. [2022-04-15 12:54:31,071 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 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 121 states. [2022-04-15 12:54:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:31,073 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2022-04-15 12:54:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-04-15 12:54:31,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:31,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:31,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:31,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-04-15 12:54:31,075 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 30 [2022-04-15 12:54:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:31,075 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-04-15 12:54:31,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:31,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2022-04-15 12:54:36,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 118 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-15 12:54:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:54:36,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:36,635 INFO L499 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:36,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:54:36,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 12:54:36,836 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -217765567, now seen corresponding path program 17 times [2022-04-15 12:54:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33668944] [2022-04-15 12:54:36,984 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1728853438, now seen corresponding path program 1 times [2022-04-15 12:54:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:36,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839990231] [2022-04-15 12:54:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:37,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {11704#(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(10, 2);call #Ultimate.allocInit(12, 3); {11691#true} is VALID [2022-04-15 12:54:37,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {11691#true} assume true; {11691#true} is VALID [2022-04-15 12:54:37,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11691#true} {11691#true} #72#return; {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {11691#true} call ULTIMATE.init(); {11704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:37,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {11704#(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(10, 2);call #Ultimate.allocInit(12, 3); {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {11691#true} assume true; {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11691#true} {11691#true} #72#return; {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {11691#true} call #t~ret13 := main(); {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {11691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {11691#true} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_46| 0) (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_52) (+ v_main_~x~0_In_26 v_main_~y~0_In_23)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_23 v_main_~y~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11691#true} is VALID [2022-04-15 12:54:37,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {11691#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11691#true} is VALID [2022-04-15 12:54:37,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {11691#true} ~z~0 := ~y~0; {11696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:54:37,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {11696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:37,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {11697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11698#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:37,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {11698#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11699#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:37,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {11699#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11700#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:37,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {11700#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11701#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:37,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {11701#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11702#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:37,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {11702#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11703#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:37,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {11692#false} assume !(~y~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {11692#false} assume !(~x~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L272 TraceCheckUtils]: 24: Hoare triple {11692#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {11692#false} ~cond := #in~cond; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {11692#false} assume 0 == ~cond; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {11692#false} assume !false; {11692#false} is VALID [2022-04-15 12:54:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:54:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839990231] [2022-04-15 12:54:37,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839990231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:37,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731229531] [2022-04-15 12:54:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:37,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:37,262 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:37,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:54:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:37,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:54:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:37,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:37,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {11691#true} call ULTIMATE.init(); {11691#true} is VALID [2022-04-15 12:54:37,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {11691#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(10, 2);call #Ultimate.allocInit(12, 3); {11691#true} is VALID [2022-04-15 12:54:37,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {11691#true} assume true; {11691#true} is VALID [2022-04-15 12:54:37,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11691#true} {11691#true} #72#return; {11691#true} is VALID [2022-04-15 12:54:37,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {11691#true} call #t~ret13 := main(); {11691#true} is VALID [2022-04-15 12:54:37,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {11691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11691#true} is VALID [2022-04-15 12:54:37,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {11691#true} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_46| 0) (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_52) (+ v_main_~x~0_In_26 v_main_~y~0_In_23)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_23 v_main_~y~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11691#true} is VALID [2022-04-15 12:54:37,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {11691#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11691#true} is VALID [2022-04-15 12:54:37,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {11691#true} ~z~0 := ~y~0; {11696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:54:37,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {11696#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:37,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {11697#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11698#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:37,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {11698#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11699#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:37,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {11699#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11744#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:54:37,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {11744#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11748#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:37,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {11748#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11752#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:54:37,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {11752#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11756#(and (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-15 12:54:37,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {11756#(and (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {11692#false} assume !(~y~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {11692#false} assume !(~x~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L272 TraceCheckUtils]: 24: Hoare triple {11692#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {11692#false} ~cond := #in~cond; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {11692#false} assume 0 == ~cond; {11692#false} is VALID [2022-04-15 12:54:37,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {11692#false} assume !false; {11692#false} is VALID [2022-04-15 12:54:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:54:37,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:38,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {11692#false} assume !false; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {11692#false} assume 0 == ~cond; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {11692#false} ~cond := #in~cond; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L272 TraceCheckUtils]: 24: Hoare triple {11692#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {11692#false} assume !(~x~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {11692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {11692#false} assume !(~y~0 % 4294967296 > 0); {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:38,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {11692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:38,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11692#false} is VALID [2022-04-15 12:54:38,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {11702#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11703#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:38,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {11701#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11702#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:38,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {11835#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11701#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:38,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {11839#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11835#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:38,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {11843#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11839#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:38,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {11847#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11843#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:38,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {11851#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11847#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:38,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {11691#true} ~z~0 := ~y~0; {11851#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:38,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {11691#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11691#true} is VALID [2022-04-15 12:54:38,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {11691#true} [126] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_46| 0) (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (= |v_main_#t~post6_Out_46| 0) (= (+ v_main_~y~0_Out_46 v_main_~x~0_Out_52) (+ v_main_~x~0_In_26 v_main_~y~0_In_23)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26)) (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_23 v_main_~y~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11691#true} is VALID [2022-04-15 12:54:38,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {11691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11691#true} is VALID [2022-04-15 12:54:38,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {11691#true} call #t~ret13 := main(); {11691#true} is VALID [2022-04-15 12:54:38,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11691#true} {11691#true} #72#return; {11691#true} is VALID [2022-04-15 12:54:38,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {11691#true} assume true; {11691#true} is VALID [2022-04-15 12:54:38,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {11691#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(10, 2);call #Ultimate.allocInit(12, 3); {11691#true} is VALID [2022-04-15 12:54:38,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {11691#true} call ULTIMATE.init(); {11691#true} is VALID [2022-04-15 12:54:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:54:38,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731229531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:38,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:38,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 12:54:38,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33668944] [2022-04-15 12:54:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33668944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:38,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:38,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:54:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68837737] [2022-04-15 12:54:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:38,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 30 [2022-04-15 12:54:38,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:38,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:38,683 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-15 12:54:38,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:54:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:54:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:54:38,684 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:42,617 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2022-04-15 12:54:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:54:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 30 [2022-04-15 12:54:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2022-04-15 12:54:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2022-04-15 12:54:42,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 52 transitions. [2022-04-15 12:54:42,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:42,798 INFO L225 Difference]: With dead ends: 148 [2022-04-15 12:54:42,799 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:54:42,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:54:42,799 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:42,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 69 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:54:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:54:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-04-15 12:54:43,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:43,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:43,224 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:43,224 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:43,225 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-04-15 12:54:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-04-15 12:54:43,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:43,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:43,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:54:43,226 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:54:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:43,227 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-04-15 12:54:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-04-15 12:54:43,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:43,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:43,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:43,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2022-04-15 12:54:43,228 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 30 [2022-04-15 12:54:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:43,228 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2022-04-15 12:54:43,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:43,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 102 transitions. [2022-04-15 12:54:46,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2022-04-15 12:54:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:54:46,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:46,390 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:46,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:54:46,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:54:46,590 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 18 times [2022-04-15 12:54:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:46,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251223755] [2022-04-15 12:54:46,694 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1860746814, now seen corresponding path program 1 times [2022-04-15 12:54:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:46,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092904377] [2022-04-15 12:54:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:49,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {12600#(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(10, 2);call #Ultimate.allocInit(12, 3); {12576#true} is VALID [2022-04-15 12:54:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {12576#true} assume true; {12576#true} is VALID [2022-04-15 12:54:49,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12576#true} {12576#true} #72#return; {12576#true} is VALID [2022-04-15 12:54:49,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {12576#true} call ULTIMATE.init(); {12600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:49,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {12600#(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(10, 2);call #Ultimate.allocInit(12, 3); {12576#true} is VALID [2022-04-15 12:54:49,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {12576#true} assume true; {12576#true} is VALID [2022-04-15 12:54:49,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12576#true} {12576#true} #72#return; {12576#true} is VALID [2022-04-15 12:54:49,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {12576#true} call #t~ret13 := main(); {12576#true} is VALID [2022-04-15 12:54:49,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {12576#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12581#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:54:49,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {12581#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [128] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= (+ v_main_~x~0_In_27 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_54)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12582#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:54:49,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {12582#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12583#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 12:54:49,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {12584#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-15 12:54:49,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {12584#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12585#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1)))} is VALID [2022-04-15 12:54:49,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {12585#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12586#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648))))} is VALID [2022-04-15 12:54:49,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {12586#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12587#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 4294967296) 4294967292 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648))))} is VALID [2022-04-15 12:54:49,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {12587#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 4294967296) 4294967292 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12588#(and (not (= main_~y~0 0)) (or (<= (+ main_~n~0 2147483644 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 2147483648) main_~z~0)) (<= main_~n~0 (+ (* 2147483648 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 2147483648)) main_~z~0 4))))} is VALID [2022-04-15 12:54:49,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {12588#(and (not (= main_~y~0 0)) (or (<= (+ main_~n~0 2147483644 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 2147483648) main_~z~0)) (<= main_~n~0 (+ (* 2147483648 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 2147483648)) main_~z~0 4))))} assume !(~z~0 % 4294967296 > 0); {12589#(and (not (= main_~y~0 0)) (<= (* main_~n~0 2) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296)) (- 8)) 4294967296) 4294967296) main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296))) (<= (div (* main_~n~0 2) 4294967296) (+ (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) (div main_~z~0 4294967296))))} is VALID [2022-04-15 12:54:49,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {12589#(and (not (= main_~y~0 0)) (<= (* main_~n~0 2) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (* (div main_~z~0 4294967296) (- 4294967296)) (- 8)) 4294967296) 4294967296) main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296))) (<= (div (* main_~n~0 2) 4294967296) (+ (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) (div main_~z~0 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12590#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))) (<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:49,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {12590#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))) (<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12591#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))) (<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:49,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {12591#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))) (<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12592#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)) (<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:54:49,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {12592#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)) (<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12593#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} is VALID [2022-04-15 12:54:49,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {12593#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} assume !(~y~0 % 4294967296 > 0); {12593#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} is VALID [2022-04-15 12:54:49,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {12593#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12594#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:49,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {12594#(and (<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12595#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 6) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:54:49,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {12595#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 6) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12596#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 12:54:49,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {12596#(and (<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:49,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:49,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:54:49,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {12598#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:54:49,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {12599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12577#false} is VALID [2022-04-15 12:54:49,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {12577#false} assume !false; {12577#false} is VALID [2022-04-15 12:54:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092904377] [2022-04-15 12:54:49,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092904377] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945574127] [2022-04-15 12:54:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:49,937 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:49,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:54:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:50,817 WARN L261 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 12:54:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:51,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:12,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {12576#true} call ULTIMATE.init(); {12576#true} is VALID [2022-04-15 12:55:12,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {12576#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(10, 2);call #Ultimate.allocInit(12, 3); {12576#true} is VALID [2022-04-15 12:55:12,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {12576#true} assume true; {12576#true} is VALID [2022-04-15 12:55:12,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12576#true} {12576#true} #72#return; {12576#true} is VALID [2022-04-15 12:55:12,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {12576#true} call #t~ret13 := main(); {12576#true} is VALID [2022-04-15 12:55:12,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {12576#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12581#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 12:55:12,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {12581#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [128] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= (+ v_main_~x~0_In_27 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_54)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12622#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 12:55:12,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12626#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:55:12,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {12626#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {12630#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 12:55:12,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {12630#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12634#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 12:55:12,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {12634#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12638#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 12:55:12,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {12638#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12642#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 12:55:12,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {12642#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (= (+ main_~n~0 3 (* (- 1) main_~y~0)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12646#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:55:12,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {12646#(and (<= 0 main_~y~0) (= (+ (- 1) main_~x~0) (+ main_~n~0 3 (* (- 1) main_~y~0))) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12650#(and (<= 0 main_~y~0) (= (+ main_~n~0 4) (+ main_~y~0 main_~x~0)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 4)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 12:55:12,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {12650#(and (<= 0 main_~y~0) (= (+ main_~n~0 4) (+ main_~y~0 main_~x~0)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (= main_~y~0 (+ main_~z~0 4)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12654#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 4)) (= (+ (- 2) main_~y~0) main_~z~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:55:12,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {12654#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 4)) (= (+ (- 2) main_~y~0) main_~z~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12658#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:55:12,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {12658#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12662#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= main_~z~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:55:12,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {12662#(and (= (+ main_~y~0 2) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= main_~z~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12666#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ (- 1) main_~z~0) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)) (= (+ main_~n~0 3 (* (- 1) main_~x~0)) (+ main_~y~0 3)))} is VALID [2022-04-15 12:55:12,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {12666#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ (- 1) main_~z~0) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= main_~x~0 (+ main_~n~0 4)) (= (+ main_~n~0 3 (* (- 1) main_~x~0)) (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {12670#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 12:55:12,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {12670#(and (= (+ main_~n~0 4) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12674#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 12:55:12,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {12674#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12678#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 12:55:12,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {12678#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12682#(and (= (+ (- 1) main_~z~0) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 12:55:12,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {12682#(and (= (+ (- 1) main_~z~0) (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12686#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ 4294967292 main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 12:55:12,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {12686#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ 4294967292 main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {12690#(and (<= 4 main_~z~0) (<= (mod (+ 4294967288 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 4 (* main_~z~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 12:55:12,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {12690#(and (<= 4 main_~z~0) (<= (mod (+ 4294967288 main_~z~0) 4294967296) 0) (<= (mod (+ main_~n~0 4 (* main_~z~0 4294967295)) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:12,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {12694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:12,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {12698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12577#false} is VALID [2022-04-15 12:55:12,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {12577#false} assume !false; {12577#false} is VALID [2022-04-15 12:55:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:12,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:52,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {12577#false} assume !false; {12577#false} is VALID [2022-04-15 12:55:52,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {12698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12577#false} is VALID [2022-04-15 12:55:52,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {12694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:55:52,086 INFO L272 TraceCheckUtils]: 24: Hoare triple {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {12694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:55:52,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {12717#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {12597#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:55:52,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {12721#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12717#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-15 12:55:52,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {12725#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12721#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-15 12:55:52,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {12729#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12725#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:55:52,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {12733#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {12729#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-15 12:55:52,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {12737#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12733#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {12741#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12737#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {12745#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12741#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {12749#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12745#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {12753#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12749#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {12757#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12753#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {12761#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12757#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:55:52,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {12765#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12761#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:55:52,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {12769#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12765#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:55:52,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {12773#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12769#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 12:55:52,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {12777#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} ~z~0 := ~y~0; {12773#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:55:52,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {12777#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12777#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-15 12:55:52,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {12784#(and (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967288 (* main_~n~0 2)) (- 4294967296))) (+ (div (+ (- 4294967292) main_~y~0 main_~x~0) 4294967296) 2))) (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (< (div (+ (- 5) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) 3 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296) (div (+ (- 4294967288) (* (- 2) main_~n~0)) 4294967296)))))} [128] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_24 v_main_~y~0_Out_48) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= (+ v_main_~x~0_In_27 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_54)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12777#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-15 12:55:52,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {12576#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12784#(and (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967288 (* main_~n~0 2)) (- 4294967296))) (+ (div (+ (- 4294967292) main_~y~0 main_~x~0) 4294967296) 2))) (or (< (div (+ (- 4294967293) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296))) (< (div (+ (- 5) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) 3 (div (+ 4294967291 main_~y~0 main_~x~0) 4294967296) (div (+ (- 4294967288) (* (- 2) main_~n~0)) 4294967296)))))} is VALID [2022-04-15 12:55:52,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {12576#true} call #t~ret13 := main(); {12576#true} is VALID [2022-04-15 12:55:52,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12576#true} {12576#true} #72#return; {12576#true} is VALID [2022-04-15 12:55:52,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {12576#true} assume true; {12576#true} is VALID [2022-04-15 12:55:52,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {12576#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(10, 2);call #Ultimate.allocInit(12, 3); {12576#true} is VALID [2022-04-15 12:55:52,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {12576#true} call ULTIMATE.init(); {12576#true} is VALID [2022-04-15 12:55:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:52,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945574127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:52,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:52,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 59 [2022-04-15 12:55:56,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:56,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251223755] [2022-04-15 12:55:56,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251223755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:56,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:56,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:55:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378332258] [2022-04-15 12:55:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:55:56,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:56,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:57,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:57,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:55:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:55:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=3487, Unknown=2, NotChecked=0, Total=4032 [2022-04-15 12:55:57,120 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,962 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-04-15 12:56:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:56:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:56:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2022-04-15 12:56:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. [2022-04-15 12:56:17,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 55 transitions. [2022-04-15 12:56:18,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:18,349 INFO L225 Difference]: With dead ends: 104 [2022-04-15 12:56:18,349 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 12:56:18,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=864, Invalid=6790, Unknown=2, NotChecked=0, Total=7656 [2022-04-15 12:56:18,351 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:18,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 12:56:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 12:56:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-04-15 12:56:18,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:18,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,798 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,798 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:18,799 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-15 12:56:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-15 12:56:18,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:18,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:18,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:56:18,800 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 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 94 states. [2022-04-15 12:56:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:18,800 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-15 12:56:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-15 12:56:18,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:18,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:18,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:18,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.2125) internal successors, (97), 80 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-04-15 12:56:18,802 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 31 [2022-04-15 12:56:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:18,802 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-04-15 12:56:18,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:18,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 101 transitions. [2022-04-15 12:56:24,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-04-15 12:56:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:56:24,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:24,192 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:24,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:24,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:24,393 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1184898047, now seen corresponding path program 19 times [2022-04-15 12:56:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329001561] [2022-04-15 12:56:24,545 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1225332414, now seen corresponding path program 1 times [2022-04-15 12:56:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:24,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927569487] [2022-04-15 12:56:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:25,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {13443#(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(10, 2);call #Ultimate.allocInit(12, 3); {13424#true} is VALID [2022-04-15 12:56:25,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {13424#true} assume true; {13424#true} is VALID [2022-04-15 12:56:25,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13424#true} {13424#true} #72#return; {13424#true} is VALID [2022-04-15 12:56:25,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {13424#true} call ULTIMATE.init(); {13443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:25,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {13443#(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(10, 2);call #Ultimate.allocInit(12, 3); {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {13424#true} assume true; {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13424#true} {13424#true} #72#return; {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {13424#true} call #t~ret13 := main(); {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {13424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {13424#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_28 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_56)) (= |v_main_#t~post5_Out_50| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {13424#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13424#true} is VALID [2022-04-15 12:56:25,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {13424#true} ~z~0 := ~y~0; {13429#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:25,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {13429#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13430#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:25,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13431#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:25,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {13431#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13432#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:25,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {13432#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13433#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:25,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {13433#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13434#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:25,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {13434#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13435#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:56:25,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {13435#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:25,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:25,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:25,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:25,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:25,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:25,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:25,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:25,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:25,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {13425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {13425#false} is VALID [2022-04-15 12:56:25,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {13425#false} assume !(~x~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:25,278 INFO L272 TraceCheckUtils]: 26: Hoare triple {13425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13425#false} is VALID [2022-04-15 12:56:25,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {13425#false} ~cond := #in~cond; {13425#false} is VALID [2022-04-15 12:56:25,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {13425#false} assume 0 == ~cond; {13425#false} is VALID [2022-04-15 12:56:25,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {13425#false} assume !false; {13425#false} is VALID [2022-04-15 12:56:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:25,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927569487] [2022-04-15 12:56:25,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927569487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233450390] [2022-04-15 12:56:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:25,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:25,280 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:56:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:25,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:56:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:25,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:25,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {13424#true} call ULTIMATE.init(); {13424#true} is VALID [2022-04-15 12:56:25,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {13424#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(10, 2);call #Ultimate.allocInit(12, 3); {13424#true} is VALID [2022-04-15 12:56:25,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {13424#true} assume true; {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13424#true} {13424#true} #72#return; {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {13424#true} call #t~ret13 := main(); {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {13424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {13424#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_28 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_56)) (= |v_main_#t~post5_Out_50| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {13424#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13424#true} is VALID [2022-04-15 12:56:25,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {13424#true} ~z~0 := ~y~0; {13429#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:56:25,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {13429#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13430#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:56:25,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {13430#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13431#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:25,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {13431#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13432#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:25,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {13432#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13433#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:25,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {13433#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13434#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:25,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {13434#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13435#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:56:25,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {13435#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:25,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:25,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:25,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:25,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:25,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:25,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:25,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:25,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {13425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {13425#false} assume !(~x~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L272 TraceCheckUtils]: 26: Hoare triple {13425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {13425#false} ~cond := #in~cond; {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {13425#false} assume 0 == ~cond; {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {13425#false} assume !false; {13425#false} is VALID [2022-04-15 12:56:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:25,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:26,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {13425#false} assume !false; {13425#false} is VALID [2022-04-15 12:56:26,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {13425#false} assume 0 == ~cond; {13425#false} is VALID [2022-04-15 12:56:26,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {13425#false} ~cond := #in~cond; {13425#false} is VALID [2022-04-15 12:56:26,958 INFO L272 TraceCheckUtils]: 26: Hoare triple {13425#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13425#false} is VALID [2022-04-15 12:56:26,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {13425#false} assume !(~x~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:26,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {13425#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {13425#false} is VALID [2022-04-15 12:56:26,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {13425#false} is VALID [2022-04-15 12:56:26,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:26,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13441#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:26,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13440#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:26,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13439#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:26,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13438#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:26,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:26,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:26,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {13576#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13436#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:26,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {13580#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13576#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:56:26,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {13584#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13580#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:56:26,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {13588#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13584#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:56:27,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {13592#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13588#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:56:27,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {13596#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13592#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:56:27,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {13600#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13596#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:27,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {13424#true} ~z~0 := ~y~0; {13600#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:27,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {13424#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {13424#true} is VALID [2022-04-15 12:56:27,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {13424#true} [130] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_28 v_main_~y~0_In_25) (+ v_main_~y~0_Out_50 v_main_~x~0_Out_56)) (= |v_main_#t~post5_Out_50| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= |v_main_#t~post6_Out_50| 0)) (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13424#true} is VALID [2022-04-15 12:56:27,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {13424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13424#true} is VALID [2022-04-15 12:56:27,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {13424#true} call #t~ret13 := main(); {13424#true} is VALID [2022-04-15 12:56:27,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13424#true} {13424#true} #72#return; {13424#true} is VALID [2022-04-15 12:56:27,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {13424#true} assume true; {13424#true} is VALID [2022-04-15 12:56:27,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {13424#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(10, 2);call #Ultimate.allocInit(12, 3); {13424#true} is VALID [2022-04-15 12:56:27,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {13424#true} call ULTIMATE.init(); {13424#true} is VALID [2022-04-15 12:56:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:56:27,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233450390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:27,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 12:56:27,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:27,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329001561] [2022-04-15 12:56:27,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329001561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:27,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:27,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:56:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60351889] [2022-04-15 12:56:27,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 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 32 [2022-04-15 12:56:27,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:27,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:27,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:27,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:56:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:56:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:56:27,721 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:58,068 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2022-04-15 12:56:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 12:56:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 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 32 [2022-04-15 12:56:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2022-04-15 12:56:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2022-04-15 12:56:58,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 101 transitions. [2022-04-15 12:57:00,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:00,944 INFO L225 Difference]: With dead ends: 129 [2022-04-15 12:57:00,944 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 12:57:00,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1042, Invalid=5438, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:57:00,946 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 111 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:00,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 95 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 12:57:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 12:57:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2022-04-15 12:57:01,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:01,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:01,505 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:01,505 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:01,506 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2022-04-15 12:57:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2022-04-15 12:57:01,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:01,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:01,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-15 12:57:01,507 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 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 108 states. [2022-04-15 12:57:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:01,508 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2022-04-15 12:57:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2022-04-15 12:57:01,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:01,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:01,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:01,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2022-04-15 12:57:01,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 32 [2022-04-15 12:57:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:01,510 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2022-04-15 12:57:01,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:01,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 119 transitions. [2022-04-15 12:57:10,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 118 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2022-04-15 12:57:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:57:10,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:10,608 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:10,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:10,819 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1799598584, now seen corresponding path program 20 times [2022-04-15 12:57:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:10,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161996340] [2022-04-15 12:57:10,967 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1248438439, now seen corresponding path program 1 times [2022-04-15 12:57:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:10,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123193177] [2022-04-15 12:57:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:11,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {14432#(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(10, 2);call #Ultimate.allocInit(12, 3); {14418#true} is VALID [2022-04-15 12:57:11,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-15 12:57:11,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14418#true} {14418#true} #72#return; {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {14418#true} call ULTIMATE.init(); {14432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:11,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {14432#(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(10, 2);call #Ultimate.allocInit(12, 3); {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14418#true} {14418#true} #72#return; {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {14418#true} call #t~ret13 := main(); {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {14418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14418#true} is VALID [2022-04-15 12:57:11,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {14418#true} [132] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_29 v_main_~x~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14418#true} is VALID [2022-04-15 12:57:11,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {14418#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:11,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:11,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14424#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:57:11,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {14424#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14425#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {14425#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14426#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {14426#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14427#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {14427#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14428#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:11,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {14428#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14431#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:57:11,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {14431#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {14419#false} is VALID [2022-04-15 12:57:11,474 INFO L272 TraceCheckUtils]: 27: Hoare triple {14419#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14419#false} is VALID [2022-04-15 12:57:11,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {14419#false} ~cond := #in~cond; {14419#false} is VALID [2022-04-15 12:57:11,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {14419#false} assume 0 == ~cond; {14419#false} is VALID [2022-04-15 12:57:11,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {14419#false} assume !false; {14419#false} is VALID [2022-04-15 12:57:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:57:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:11,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123193177] [2022-04-15 12:57:11,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123193177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:11,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421561075] [2022-04-15 12:57:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:11,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:11,476 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:11,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:57:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:11,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:57:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:11,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:11,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {14418#true} call ULTIMATE.init(); {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#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(10, 2);call #Ultimate.allocInit(12, 3); {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14418#true} {14418#true} #72#return; {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {14418#true} call #t~ret13 := main(); {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {14418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14418#true} is VALID [2022-04-15 12:57:11,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {14418#true} [132] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_29 v_main_~x~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14418#true} is VALID [2022-04-15 12:57:11,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {14418#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:11,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:57:11,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {14423#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14424#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:57:11,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {14424#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14425#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {14425#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14426#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {14426#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14427#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {14427#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14428#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:57:11,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {14428#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {14430#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:11,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {14429#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14419#false} is VALID [2022-04-15 12:57:11,889 INFO L272 TraceCheckUtils]: 27: Hoare triple {14419#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14419#false} is VALID [2022-04-15 12:57:11,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {14419#false} ~cond := #in~cond; {14419#false} is VALID [2022-04-15 12:57:11,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {14419#false} assume 0 == ~cond; {14419#false} is VALID [2022-04-15 12:57:11,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {14419#false} assume !false; {14419#false} is VALID [2022-04-15 12:57:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:57:11,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:12,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {14419#false} assume !false; {14419#false} is VALID [2022-04-15 12:57:12,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {14419#false} assume 0 == ~cond; {14419#false} is VALID [2022-04-15 12:57:12,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {14419#false} ~cond := #in~cond; {14419#false} is VALID [2022-04-15 12:57:12,723 INFO L272 TraceCheckUtils]: 27: Hoare triple {14419#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {14419#false} is VALID [2022-04-15 12:57:12,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {14538#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14419#false} is VALID [2022-04-15 12:57:12,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {14538#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:57:12,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {14538#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14542#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:57:12,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {14576#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14538#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:57:12,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {14580#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14576#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 12:57:12,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {14584#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14580#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 12:57:12,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {14588#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14584#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 12:57:12,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {14592#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14588#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 12:57:12,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {14596#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14592#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 12:57:12,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {14596#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {14596#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 12:57:12,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {14418#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14596#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 12:57:12,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {14418#true} [132] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post6_Out_52| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_29 v_main_~x~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14418#true} is VALID [2022-04-15 12:57:12,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {14418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {14418#true} call #t~ret13 := main(); {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14418#true} {14418#true} #72#return; {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#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(10, 2);call #Ultimate.allocInit(12, 3); {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {14418#true} call ULTIMATE.init(); {14418#true} is VALID [2022-04-15 12:57:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 12:57:12,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421561075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:12,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:12,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-15 12:57:13,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:13,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161996340] [2022-04-15 12:57:13,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161996340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:13,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:13,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:57:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290562705] [2022-04-15 12:57:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:57:13,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:13,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:13,347 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-15 12:57:13,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:57:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:57:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:57:13,348 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:21,374 INFO L93 Difference]: Finished difference Result 153 states and 191 transitions. [2022-04-15 12:57:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:57:21,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:57:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-15 12:57:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-15 12:57:21,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 91 transitions. [2022-04-15 12:57:21,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:21,924 INFO L225 Difference]: With dead ends: 153 [2022-04-15 12:57:21,924 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 12:57:21,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:57:21,925 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:21,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 51 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 12:57:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 12:57:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2022-04-15 12:57:22,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:22,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:22,561 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:22,561 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:22,563 INFO L93 Difference]: Finished difference Result 147 states and 176 transitions. [2022-04-15 12:57:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2022-04-15 12:57:22,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:22,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:22,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 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 147 states. [2022-04-15 12:57:22,563 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 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 147 states. [2022-04-15 12:57:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:22,565 INFO L93 Difference]: Finished difference Result 147 states and 176 transitions. [2022-04-15 12:57:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2022-04-15 12:57:22,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:22,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:22,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:22,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-04-15 12:57:22,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 33 [2022-04-15 12:57:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:22,566 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-04-15 12:57:22,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:22,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 133 transitions. [2022-04-15 12:57:31,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-04-15 12:57:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:57:31,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:31,736 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:31,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:31,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:31,947 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1475115858, now seen corresponding path program 21 times [2022-04-15 12:57:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308001511] [2022-04-15 12:57:32,102 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:57:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1677571283, now seen corresponding path program 1 times [2022-04-15 12:57:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:32,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566621288] [2022-04-15 12:57:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:33,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:33,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {15499#(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(10, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 12:57:33,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15478#true} {15478#true} #72#return; {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {15478#true} call ULTIMATE.init(); {15499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:33,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {15499#(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(10, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15478#true} {15478#true} #72#return; {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {15478#true} call #t~ret13 := main(); {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {15478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15478#true} is VALID [2022-04-15 12:57:33,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {15478#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_60) (+ v_main_~x~0_In_30 v_main_~y~0_In_27)) (= |v_main_#t~post5_Out_54| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post6_Out_54| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15478#true} is VALID [2022-04-15 12:57:33,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {15478#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15478#true} is VALID [2022-04-15 12:57:33,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {15478#true} ~z~0 := ~y~0; {15483#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:33,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {15483#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:33,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {15484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:33,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {15485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15486#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:33,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {15486#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15487#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:33,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {15487#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15488#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:33,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {15488#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15489#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:57:33,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {15489#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15490#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:33,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {15490#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:33,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:33,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:57:33,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:33,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:33,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:33,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:33,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:33,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:33,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {15479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {15479#false} assume !(~x~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {15479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {15479#false} ~cond := #in~cond; {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {15479#false} assume 0 == ~cond; {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {15479#false} assume !false; {15479#false} is VALID [2022-04-15 12:57:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:33,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:33,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566621288] [2022-04-15 12:57:33,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566621288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:33,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16630687] [2022-04-15 12:57:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:33,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:33,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:33,303 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:33,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:57:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:33,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:57:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:33,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:34,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {15478#true} call ULTIMATE.init(); {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {15478#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(10, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15478#true} {15478#true} #72#return; {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {15478#true} call #t~ret13 := main(); {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {15478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15478#true} is VALID [2022-04-15 12:57:34,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {15478#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_60) (+ v_main_~x~0_In_30 v_main_~y~0_In_27)) (= |v_main_#t~post5_Out_54| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post6_Out_54| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15478#true} is VALID [2022-04-15 12:57:34,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {15478#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15478#true} is VALID [2022-04-15 12:57:34,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {15478#true} ~z~0 := ~y~0; {15483#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:57:34,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {15483#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:57:34,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {15484#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:57:34,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {15485#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15486#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:57:34,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {15486#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15487#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:57:34,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {15487#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15488#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:34,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {15488#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15489#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:57:34,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {15489#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15490#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:57:34,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {15490#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:34,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:34,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:57:34,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:34,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:34,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:34,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:34,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:34,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:34,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {15479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {15479#false} assume !(~x~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L272 TraceCheckUtils]: 28: Hoare triple {15479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {15479#false} ~cond := #in~cond; {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {15479#false} assume 0 == ~cond; {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {15479#false} assume !false; {15479#false} is VALID [2022-04-15 12:57:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:34,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:35,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {15479#false} assume !false; {15479#false} is VALID [2022-04-15 12:57:35,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {15479#false} assume 0 == ~cond; {15479#false} is VALID [2022-04-15 12:57:35,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {15479#false} ~cond := #in~cond; {15479#false} is VALID [2022-04-15 12:57:35,846 INFO L272 TraceCheckUtils]: 28: Hoare triple {15479#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {15479#false} is VALID [2022-04-15 12:57:35,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {15479#false} assume !(~x~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:35,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {15479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {15479#false} is VALID [2022-04-15 12:57:35,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {15479#false} is VALID [2022-04-15 12:57:35,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15498#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:57:35,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15497#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:57:35,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15496#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:57:35,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15495#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:57:35,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15494#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:57:35,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15493#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:57:35,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15492#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:57:35,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:35,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {15641#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15491#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:57:35,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {15645#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15641#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:57:35,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {15649#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15645#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:57:35,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {15653#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15649#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:57:35,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {15657#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15653#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:57:35,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {15661#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15657#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:57:35,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {15665#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15661#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:57:35,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {15669#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15665#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:57:35,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {15478#true} ~z~0 := ~y~0; {15669#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 12:57:35,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {15478#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {15478#true} [134] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_60) (+ v_main_~x~0_In_30 v_main_~y~0_In_27)) (= |v_main_#t~post5_Out_54| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= |v_main_#t~post6_Out_54| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_30 v_main_~x~0_Out_60))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {15478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {15478#true} call #t~ret13 := main(); {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15478#true} {15478#true} #72#return; {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {15478#true} assume true; {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {15478#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(10, 2);call #Ultimate.allocInit(12, 3); {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {15478#true} call ULTIMATE.init(); {15478#true} is VALID [2022-04-15 12:57:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:57:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16630687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:35,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:35,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 12:57:36,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:36,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308001511] [2022-04-15 12:57:36,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308001511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:36,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:36,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:57:36,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449607042] [2022-04-15 12:57:36,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:36,841 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:57:36,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:36,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:36,980 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-15 12:57:36,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:57:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:57:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:57:36,981 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:39,317 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-15 12:58:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 12:58:39,318 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:58:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 126 transitions. [2022-04-15 12:58:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 126 transitions. [2022-04-15 12:58:39,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 126 transitions. [2022-04-15 12:58:42,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:42,518 INFO L225 Difference]: With dead ends: 161 [2022-04-15 12:58:42,518 INFO L226 Difference]: Without dead ends: 138 [2022-04-15 12:58:42,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2665 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=1561, Invalid=8539, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 12:58:42,520 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 174 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:42,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 104 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-04-15 12:58:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-15 12:58:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2022-04-15 12:58:43,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:43,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:43,300 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:43,300 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:43,302 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2022-04-15 12:58:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2022-04-15 12:58:43,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:43,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:43,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-15 12:58:43,302 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 138 states. [2022-04-15 12:58:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:43,303 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2022-04-15 12:58:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2022-04-15 12:58:43,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:43,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:43,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:43,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2022-04-15 12:58:43,305 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 34 [2022-04-15 12:58:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:43,305 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2022-04-15 12:58:43,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:43,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 154 transitions. [2022-04-15 12:58:59,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 152 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2022-04-15 12:58:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:58:59,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:59,870 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:59,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:00,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 12:59:00,071 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -943546153, now seen corresponding path program 22 times [2022-04-15 12:59:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:00,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [800960167] [2022-04-15 12:59:00,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1272094922, now seen corresponding path program 1 times [2022-04-15 12:59:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:00,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838856242] [2022-04-15 12:59:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:01,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {16715#(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(10, 2);call #Ultimate.allocInit(12, 3); {16700#true} is VALID [2022-04-15 12:59:01,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {16700#true} assume true; {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16700#true} {16700#true} #72#return; {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {16700#true} call ULTIMATE.init(); {16715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:01,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {16715#(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(10, 2);call #Ultimate.allocInit(12, 3); {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {16700#true} assume true; {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16700#true} {16700#true} #72#return; {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {16700#true} call #t~ret13 := main(); {16700#true} is VALID [2022-04-15 12:59:01,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {16700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16700#true} is VALID [2022-04-15 12:59:01,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {16700#true} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_56 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_28)) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16700#true} is VALID [2022-04-15 12:59:01,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {16700#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16705#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:59:01,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {16705#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {16705#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:59:01,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {16705#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16706#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:59:01,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {16706#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16707#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {16707#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16708#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {16708#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16709#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {16709#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16710#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:59:01,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {16710#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16711#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {16711#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16712#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {16712#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:01,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {16714#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 12:59:01,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {16714#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16701#false} is VALID [2022-04-15 12:59:01,455 INFO L272 TraceCheckUtils]: 29: Hoare triple {16701#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16701#false} is VALID [2022-04-15 12:59:01,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {16701#false} ~cond := #in~cond; {16701#false} is VALID [2022-04-15 12:59:01,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {16701#false} assume 0 == ~cond; {16701#false} is VALID [2022-04-15 12:59:01,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {16701#false} assume !false; {16701#false} is VALID [2022-04-15 12:59:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 12:59:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:01,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838856242] [2022-04-15 12:59:01,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838856242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:01,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246818721] [2022-04-15 12:59:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:01,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:01,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:01,457 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:01,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:59:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:01,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:59:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:03,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {16700#true} call ULTIMATE.init(); {16700#true} is VALID [2022-04-15 12:59:03,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {16700#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(10, 2);call #Ultimate.allocInit(12, 3); {16700#true} is VALID [2022-04-15 12:59:03,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {16700#true} assume true; {16700#true} is VALID [2022-04-15 12:59:03,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16700#true} {16700#true} #72#return; {16700#true} is VALID [2022-04-15 12:59:03,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {16700#true} call #t~ret13 := main(); {16700#true} is VALID [2022-04-15 12:59:03,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {16700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16734#(= main_~y~0 0)} is VALID [2022-04-15 12:59:03,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {16734#(= main_~y~0 0)} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_56 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_28)) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16738#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:59:03,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {16738#(or (and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296))) (= main_~y~0 0))} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16742#(and (<= 0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-15 12:59:03,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {16742#(and (<= 0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {16746#(and (not (< 0 (mod main_~x~0 4294967296))) (<= 0 main_~z~0))} is VALID [2022-04-15 12:59:03,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {16746#(and (not (< 0 (mod main_~x~0 4294967296))) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16750#(and (<= 0 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-15 12:59:03,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {16750#(and (<= 0 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16754#(and (<= 0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:59:03,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {16754#(and (<= 0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16758#(and (<= 0 (+ main_~z~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:59:03,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {16758#(and (<= 0 (+ main_~z~0 3)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16762#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= 0 (+ main_~z~0 4)))} is VALID [2022-04-15 12:59:03,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {16762#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= 0 (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16766#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= 0 (+ 5 main_~z~0)))} is VALID [2022-04-15 12:59:03,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {16766#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= 0 (+ 5 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16770#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= 0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:59:03,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {16770#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= 0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16774#(and (not (< 0 (mod (+ main_~x~0 4294967289) 4294967296))) (<= 0 (+ 7 main_~z~0)))} is VALID [2022-04-15 12:59:03,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {16774#(and (not (< 0 (mod (+ main_~x~0 4294967289) 4294967296))) (<= 0 (+ 7 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16778#(and (not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= 0 (+ main_~z~0 8)))} is VALID [2022-04-15 12:59:03,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {16778#(and (not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= 0 (+ main_~z~0 8)))} assume !(~z~0 % 4294967296 > 0); {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {16713#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {16712#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:03,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {16712#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16701#false} is VALID [2022-04-15 12:59:03,665 INFO L272 TraceCheckUtils]: 29: Hoare triple {16701#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16701#false} is VALID [2022-04-15 12:59:03,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {16701#false} ~cond := #in~cond; {16701#false} is VALID [2022-04-15 12:59:03,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {16701#false} assume 0 == ~cond; {16701#false} is VALID [2022-04-15 12:59:03,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {16701#false} assume !false; {16701#false} is VALID [2022-04-15 12:59:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 12:59:03,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:05,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {16701#false} assume !false; {16701#false} is VALID [2022-04-15 12:59:05,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {16701#false} assume 0 == ~cond; {16701#false} is VALID [2022-04-15 12:59:05,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {16701#false} ~cond := #in~cond; {16701#false} is VALID [2022-04-15 12:59:05,416 INFO L272 TraceCheckUtils]: 29: Hoare triple {16701#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16701#false} is VALID [2022-04-15 12:59:05,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {16839#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16701#false} is VALID [2022-04-15 12:59:05,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {16839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:59:05,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {16874#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16843#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 12:59:05,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {16878#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16874#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:59:05,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {16882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16878#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:59:05,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {16886#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 12:59:05,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {16890#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16886#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-15 12:59:05,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {16894#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16890#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:05,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {16898#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16894#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:05,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {16902#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16898#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:05,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {16906#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16902#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:59:05,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {16910#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} ~z~0 := ~y~0; {16906#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:59:05,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {16700#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16910#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-15 12:59:05,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {16700#true} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= (+ v_main_~y~0_Out_56 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_28)) (= |v_main_#t~post6_Out_56| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16700#true} is VALID [2022-04-15 12:59:05,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {16700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16700#true} is VALID [2022-04-15 12:59:05,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {16700#true} call #t~ret13 := main(); {16700#true} is VALID [2022-04-15 12:59:05,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16700#true} {16700#true} #72#return; {16700#true} is VALID [2022-04-15 12:59:05,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {16700#true} assume true; {16700#true} is VALID [2022-04-15 12:59:05,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {16700#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(10, 2);call #Ultimate.allocInit(12, 3); {16700#true} is VALID [2022-04-15 12:59:05,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {16700#true} call ULTIMATE.init(); {16700#true} is VALID [2022-04-15 12:59:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 12:59:05,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246818721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:05,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:05,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14] total 37 [2022-04-15 12:59:06,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:06,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [800960167] [2022-04-15 12:59:06,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [800960167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:06,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:06,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:59:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294130189] [2022-04-15 12:59:06,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:59:06,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:06,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:06,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:06,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:59:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:06,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:59:06,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:59:06,542 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:17,530 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-04-15 12:59:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:59:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:59:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-15 12:59:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-15 12:59:17,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2022-04-15 12:59:18,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:18,219 INFO L225 Difference]: With dead ends: 184 [2022-04-15 12:59:18,220 INFO L226 Difference]: Without dead ends: 178 [2022-04-15 12:59:18,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=668, Invalid=2412, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:59:18,220 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:18,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 44 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 12:59:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-15 12:59:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2022-04-15 12:59:19,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:19,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:19,073 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:19,073 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:19,075 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2022-04-15 12:59:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2022-04-15 12:59:19,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:19,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:19,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 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 178 states. [2022-04-15 12:59:19,075 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 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 178 states. [2022-04-15 12:59:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:19,077 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2022-04-15 12:59:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2022-04-15 12:59:19,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:19,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:19,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:19,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2022-04-15 12:59:19,079 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 35 [2022-04-15 12:59:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:19,079 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2022-04-15 12:59:19,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:19,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 167 transitions. [2022-04-15 12:59:39,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 163 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2022-04-15 12:59:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:59:39,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:39,755 INFO L499 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:39,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:39,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-15 12:59:39,966 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 900073496, now seen corresponding path program 23 times [2022-04-15 12:59:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:39,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052728805] [2022-04-15 12:59:40,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1467649086, now seen corresponding path program 1 times [2022-04-15 12:59:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226046175] [2022-04-15 12:59:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:40,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {17985#(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(10, 2);call #Ultimate.allocInit(12, 3); {17970#true} is VALID [2022-04-15 12:59:40,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {17970#true} assume true; {17970#true} is VALID [2022-04-15 12:59:40,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17970#true} {17970#true} #72#return; {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {17970#true} call ULTIMATE.init(); {17985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {17985#(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(10, 2);call #Ultimate.allocInit(12, 3); {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {17970#true} assume true; {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17970#true} {17970#true} #72#return; {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {17970#true} call #t~ret13 := main(); {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {17970#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {17970#true} [138] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_29 v_main_~y~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {17970#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17970#true} is VALID [2022-04-15 12:59:40,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {17970#true} ~z~0 := ~y~0; {17975#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:40,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {17975#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17976#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:40,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {17976#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17977#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:40,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {17977#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17978#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:40,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {17978#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17979#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:40,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {17979#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {17980#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 12:59:40,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {17980#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17981#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:40,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {17981#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17982#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:40,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {17982#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17983#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:40,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {17983#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17984#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {17984#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {17971#false} assume !(~y~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:40,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {17971#false} assume !(~x~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L272 TraceCheckUtils]: 28: Hoare triple {17971#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {17971#false} ~cond := #in~cond; {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {17971#false} assume 0 == ~cond; {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {17971#false} assume !false; {17971#false} is VALID [2022-04-15 12:59:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:59:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226046175] [2022-04-15 12:59:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226046175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644468832] [2022-04-15 12:59:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:40,952 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:40,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:59:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:40,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:59:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:41,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:41,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {17970#true} call ULTIMATE.init(); {17970#true} is VALID [2022-04-15 12:59:41,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {17970#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(10, 2);call #Ultimate.allocInit(12, 3); {17970#true} is VALID [2022-04-15 12:59:41,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {17970#true} assume true; {17970#true} is VALID [2022-04-15 12:59:41,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17970#true} {17970#true} #72#return; {17970#true} is VALID [2022-04-15 12:59:41,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {17970#true} call #t~ret13 := main(); {17970#true} is VALID [2022-04-15 12:59:41,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {17970#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17970#true} is VALID [2022-04-15 12:59:41,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {17970#true} [138] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_29 v_main_~y~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17970#true} is VALID [2022-04-15 12:59:41,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {17970#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17970#true} is VALID [2022-04-15 12:59:41,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {17970#true} ~z~0 := ~y~0; {17975#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:41,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {17975#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17976#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:41,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {17976#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17977#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:41,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {17977#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17978#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:41,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {17978#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17979#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:41,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {17979#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {18028#(and (<= main_~y~0 (+ main_~z~0 4)) (not (< 0 (mod main_~z~0 4294967296))) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:41,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {18028#(and (<= main_~y~0 (+ main_~z~0 4)) (not (< 0 (mod main_~z~0 4294967296))) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18032#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:41,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {18032#(and (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18036#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:59:41,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {18036#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18040#(and (<= main_~z~0 (+ main_~y~0 2)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 12:59:41,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {18040#(and (<= main_~z~0 (+ main_~y~0 2)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= (+ main_~y~0 2) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18044#(and (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-15 12:59:41,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {18044#(and (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:41,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:41,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:41,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {17971#false} assume !(~y~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {17971#false} assume !(~x~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L272 TraceCheckUtils]: 28: Hoare triple {17971#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {17971#false} ~cond := #in~cond; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {17971#false} assume 0 == ~cond; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {17971#false} assume !false; {17971#false} is VALID [2022-04-15 12:59:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:59:41,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:43,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {17971#false} assume !false; {17971#false} is VALID [2022-04-15 12:59:43,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {17971#false} assume 0 == ~cond; {17971#false} is VALID [2022-04-15 12:59:43,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {17971#false} ~cond := #in~cond; {17971#false} is VALID [2022-04-15 12:59:43,400 INFO L272 TraceCheckUtils]: 28: Hoare triple {17971#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {17971#false} is VALID [2022-04-15 12:59:43,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {17971#false} assume !(~x~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:43,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {17971#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {17971#false} assume !(~y~0 % 4294967296 > 0); {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:43,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {17971#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:43,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {17984#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#false} is VALID [2022-04-15 12:59:43,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {17983#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17984#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:43,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {17982#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17983#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:43,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {17981#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17982#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:43,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {18138#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17981#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:43,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {18142#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18138#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:43,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {18146#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18142#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:43,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {18150#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18146#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:59:43,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {18154#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18150#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:43,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {18158#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18154#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:59:43,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {17970#true} ~z~0 := ~y~0; {18158#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:59:43,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {17970#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {17970#true} [138] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_64) (+ v_main_~x~0_In_32 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (= |v_main_#t~post5_Out_58| 0) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post6_Out_58| 0)) (and (= v_main_~x~0_In_32 v_main_~x~0_Out_64) (= v_main_~y~0_In_29 v_main_~y~0_Out_58))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {17970#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {17970#true} call #t~ret13 := main(); {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17970#true} {17970#true} #72#return; {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {17970#true} assume true; {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {17970#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(10, 2);call #Ultimate.allocInit(12, 3); {17970#true} is VALID [2022-04-15 12:59:43,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {17970#true} call ULTIMATE.init(); {17970#true} is VALID [2022-04-15 12:59:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 12:59:43,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644468832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:43,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:43,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 12:59:44,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:44,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052728805] [2022-04-15 12:59:44,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052728805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:44,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:44,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:59:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516204845] [2022-04-15 12:59:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 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 35 [2022-04-15 12:59:44,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:44,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:44,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:44,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:59:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:59:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:59:44,978 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:58,620 INFO L93 Difference]: Finished difference Result 205 states and 248 transitions. [2022-04-15 12:59:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:59:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 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 35 [2022-04-15 12:59:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 58 transitions. [2022-04-15 12:59:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 58 transitions. [2022-04-15 12:59:58,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 58 transitions. [2022-04-15 12:59:59,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:59,017 INFO L225 Difference]: With dead ends: 205 [2022-04-15 12:59:59,017 INFO L226 Difference]: Without dead ends: 138 [2022-04-15 12:59:59,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=311, Invalid=2239, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:59:59,018 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:59,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 12:59:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-15 12:59:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2022-04-15 12:59:59,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:59,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:59,771 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:59,771 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:59,773 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-04-15 12:59:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-15 12:59:59,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:59,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:59,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 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 138 states. [2022-04-15 12:59:59,773 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 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 138 states. [2022-04-15 12:59:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:59,774 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-04-15 12:59:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-15 12:59:59,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:59,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:59,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:59,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 117 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2022-04-15 12:59:59,776 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 35 [2022-04-15 12:59:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:59,776 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2022-04-15 12:59:59,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:59,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 146 transitions. [2022-04-15 13:00:14,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 145 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-04-15 13:00:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:00:14,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:00:14,278 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:00:14,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 13:00:14,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 13:00:14,479 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:00:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:00:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 24 times [2022-04-15 13:00:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:14,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052844003] [2022-04-15 13:00:14,652 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:00:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash -960830137, now seen corresponding path program 1 times [2022-04-15 13:00:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:00:14,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204455005] [2022-04-15 13:00:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:00:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:00:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:16,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {19197#(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(10, 2);call #Ultimate.allocInit(12, 3); {19170#true} is VALID [2022-04-15 13:00:16,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {19170#true} assume true; {19170#true} is VALID [2022-04-15 13:00:16,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19170#true} {19170#true} #72#return; {19170#true} is VALID [2022-04-15 13:00:16,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {19170#true} call ULTIMATE.init(); {19197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:00:16,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {19197#(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(10, 2);call #Ultimate.allocInit(12, 3); {19170#true} is VALID [2022-04-15 13:00:16,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#true} assume true; {19170#true} is VALID [2022-04-15 13:00:16,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#true} {19170#true} #72#return; {19170#true} is VALID [2022-04-15 13:00:16,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#true} call #t~ret13 := main(); {19170#true} is VALID [2022-04-15 13:00:16,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {19170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 13:00:16,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {19175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [140] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19176#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-15 13:00:16,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {19176#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19177#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 13:00:16,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {19177#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {19178#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-15 13:00:16,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {19178#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19179#(<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1))} is VALID [2022-04-15 13:00:16,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {19179#(<= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 4294967294 (* 4294967296 (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 2147483648)) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19180#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648)))} is VALID [2022-04-15 13:00:16,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {19180#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296) (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 2147483648) 4294967296) 4294967293) 4294967296) 2147483648)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19181#(<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 4294967296) 4294967292 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648)))} is VALID [2022-04-15 13:00:16,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {19181#(<= main_~n~0 (+ main_~z~0 3 (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 2147483648) 4294967296) 4294967292 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19182#(<= main_~n~0 (+ (* (div (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 2147483648)) 4294967291 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 4))} is VALID [2022-04-15 13:00:16,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {19182#(<= main_~n~0 (+ (* (div (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 2147483648)) 4294967291 (* (- 1) main_~z~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 2147483648) main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19183#(<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483642) 2147483648) 2147483648) 5 main_~z~0) main_~n~0)} is VALID [2022-04-15 13:00:16,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {19183#(<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 2147483642) 2147483648) 2147483648) 5 main_~z~0) main_~n~0)} assume !(~z~0 % 4294967296 > 0); {19184#(and (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967285 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 (* (div main_~z~0 4294967296) 4294967296) 10) (* main_~n~0 2)) (<= (div (* main_~n~0 2) 4294967296) (+ (div main_~z~0 4294967296) (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296))))} is VALID [2022-04-15 13:00:16,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {19184#(and (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967285 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) main_~z~0 (* (div main_~z~0 4294967296) 4294967296) 10) (* main_~n~0 2)) (<= (div (* main_~n~0 2) 4294967296) (+ (div main_~z~0 4294967296) (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19185#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0)) (<= (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967286) 4294967296) 4294967296) main_~z~0 9) (* main_~n~0 2)))} is VALID [2022-04-15 13:00:16,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {19185#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 1) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0)) (<= (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967286) 4294967296) 4294967296) main_~z~0 9) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19186#(and (<= (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967287) 4294967296) 4294967296) 8) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:16,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {19186#(and (<= (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967287) 4294967296) 4294967296) 8) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19187#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))) (<= (+ 7 main_~z~0 (* 4294967296 (div (+ 4294967288 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-15 13:00:16,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {19187#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 3) (+ main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296))) (<= (+ 7 main_~z~0 (* 4294967296 (div (+ 4294967288 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296))) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19188#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967289) 4294967296) 4294967296)) (* main_~n~0 2)))} is VALID [2022-04-15 13:00:16,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {19188#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 4) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967289) 4294967296) 4294967296)) (* main_~n~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19189#(and (<= (+ 5 main_~z~0 (* (div (+ 4294967290 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 13:00:16,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {19189#(and (<= (+ 5 main_~z~0 (* (div (+ 4294967290 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} assume !(~y~0 % 4294967296 > 0); {19189#(and (<= (+ 5 main_~z~0 (* (div (+ 4294967290 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 13:00:16,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {19189#(and (<= (+ 5 main_~z~0 (* (div (+ 4294967290 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5) (+ (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19190#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 6) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (+ (* (div (+ 4294967291 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 4) (* main_~n~0 2)))} is VALID [2022-04-15 13:00:16,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {19190#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 6) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0)) (<= (+ (* (div (+ 4294967291 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 4) (* main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19191#(and (<= (+ main_~z~0 3 (* (div (+ 4294967292 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:16,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {19191#(and (<= (+ main_~z~0 3 (* (div (+ 4294967292 (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19192#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 8) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} is VALID [2022-04-15 13:00:17,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {19192#(and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 8) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)) (<= (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967293) 4294967296)) main_~z~0 2) (* main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19193#(and (<= (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967294) 4294967296)) 1) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 9) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-15 13:00:17,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {19193#(and (<= (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) 4294967294) 4294967296)) 1) (* main_~n~0 2)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 9) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:17,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:00:17,011 INFO L272 TraceCheckUtils]: 27: Hoare triple {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:00:17,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {19195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:00:17,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {19196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19171#false} is VALID [2022-04-15 13:00:17,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {19171#false} assume !false; {19171#false} is VALID [2022-04-15 13:00:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:00:17,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204455005] [2022-04-15 13:00:17,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204455005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:00:17,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493994488] [2022-04-15 13:00:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:00:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:00:17,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:00:17,013 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:00:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 13:00:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:20,633 WARN L261 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 13:00:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:00:20,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:00:44,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {19170#true} call ULTIMATE.init(); {19170#true} is VALID [2022-04-15 13:00:44,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {19170#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(10, 2);call #Ultimate.allocInit(12, 3); {19170#true} is VALID [2022-04-15 13:00:44,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#true} assume true; {19170#true} is VALID [2022-04-15 13:00:44,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#true} {19170#true} #72#return; {19170#true} is VALID [2022-04-15 13:00:44,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#true} call #t~ret13 := main(); {19170#true} is VALID [2022-04-15 13:00:44,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {19170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 13:00:44,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {19175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [140] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19219#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-15 13:00:44,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {19219#(or (and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 main_~n~0) (= main_~n~0 (+ main_~y~0 main_~x~0))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19223#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:44,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {19223#(and (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} ~z~0 := ~y~0; {19227#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 13:00:44,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {19227#(and (= main_~z~0 main_~y~0) (<= main_~x~0 main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19231#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 13:00:44,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {19231#(and (= (+ main_~n~0 (* (- 1) main_~y~0) 1) main_~x~0) (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19235#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-15 13:00:44,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {19235#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19239#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))))} is VALID [2022-04-15 13:00:44,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {19239#(and (<= 0 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 2 (* (- 1) main_~y~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19243#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) (+ (- 2) main_~x~0)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 13:00:44,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {19243#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) (+ (- 2) main_~x~0)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19247#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (= (+ 5 main_~n~0 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 13:00:44,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {19247#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (= (+ 5 main_~n~0 (* (- 1) main_~y~0)) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {19251#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (= (+ 5 main_~n~0 (* (- 1) main_~y~0)) main_~x~0))} is VALID [2022-04-15 13:00:44,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {19251#(and (<= 0 main_~y~0) (not (< 0 (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (not (< 0 (mod main_~z~0 4294967296))) (= (+ 5 main_~n~0 (* (- 1) main_~y~0)) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19255#(and (= (+ main_~n~0 4) (+ main_~y~0 main_~x~0)) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 13:00:45,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {19255#(and (= (+ main_~n~0 4) (+ main_~y~0 main_~x~0)) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (= main_~y~0 (+ main_~z~0 3)) (<= 0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19259#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 4)) (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-15 13:00:45,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {19259#(and (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 4)) (<= 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~y~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 2) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19263#(and (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 4)) (<= 0 (+ main_~y~0 3)) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 13:00:45,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {19263#(and (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 4)) (<= 0 (+ main_~y~0 3)) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295) 4294967293) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19267#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:00:45,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {19267#(and (= (+ main_~n~0 (* (- 1) main_~x~0) 4) main_~z~0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19271#(and (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:00:45,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {19271#(and (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {19275#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} is VALID [2022-04-15 13:00:45,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {19275#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ 5 main_~n~0)) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)) (<= (mod (+ 4294967291 main_~x~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19279#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} is VALID [2022-04-15 13:00:45,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {19279#(and (<= (mod (+ 4294967292 main_~x~0) 4294967296) 0) (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19283#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ (- 1) main_~z~0)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0))} is VALID [2022-04-15 13:00:45,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {19283#(and (<= main_~x~0 (+ main_~n~0 3)) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ (- 1) main_~z~0)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19287#(and (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-15 13:00:45,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {19287#(and (= main_~z~0 (+ 5 main_~n~0 (* (- 1) main_~x~0))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19291#(and (<= (mod (+ 4294967292 main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ (- 1) main_~z~0)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} is VALID [2022-04-15 13:00:45,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {19291#(and (<= (mod (+ 4294967292 main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 4) (+ (- 1) main_~z~0)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ main_~n~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19295#(and (<= (mod (+ main_~z~0 4294967286) 4294967296) 0) (<= (mod (+ 5 main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= 5 main_~z~0) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)))} is VALID [2022-04-15 13:00:45,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {19295#(and (<= (mod (+ main_~z~0 4294967286) 4294967296) 0) (<= (mod (+ 5 main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= 5 main_~z~0) (= (+ 5 main_~n~0) (+ main_~z~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {19299#(and (<= (mod (+ main_~z~0 4294967286) 4294967296) 0) (<= (mod (+ 5 main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= 5 main_~z~0))} is VALID [2022-04-15 13:00:45,073 INFO L272 TraceCheckUtils]: 27: Hoare triple {19299#(and (<= (mod (+ main_~z~0 4294967286) 4294967296) 0) (<= (mod (+ 5 main_~n~0 (* main_~z~0 4294967295)) 4294967296) 0) (<= 5 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19303#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:00:45,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {19303#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19307#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:00:45,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {19307#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19171#false} is VALID [2022-04-15 13:00:45,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {19171#false} assume !false; {19171#false} is VALID [2022-04-15 13:00:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:45,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:22,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {19171#false} assume !false; {19171#false} is VALID [2022-04-15 13:01:22,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {19307#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19171#false} is VALID [2022-04-15 13:01:22,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {19303#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19307#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:01:22,193 INFO L272 TraceCheckUtils]: 27: Hoare triple {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {19303#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:01:22,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {19326#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {19194#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 13:01:22,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {19330#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19326#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-15 13:01:22,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {19334#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19330#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-15 13:01:22,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {19338#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19334#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 13:01:22,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {19342#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19338#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-15 13:01:22,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {19346#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {19342#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {19350#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {19346#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 13:01:22,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {19354#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19350#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 13:01:22,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {19358#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19354#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {19362#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19358#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {19366#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19362#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {19370#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19366#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {19374#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19370#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {19378#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19374#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 11)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10) (+ (* main_~n~0 2) (* (div (+ main_~z~0 10) 4294967296) 4294967296)))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {19382#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19378#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 10)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9) (+ (* main_~n~0 2) (* (div (+ main_~z~0 9) 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-15 13:01:22,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {19386#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19382#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))))} is VALID [2022-04-15 13:01:22,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {19390#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19386#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:01:22,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {19394#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19390#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 13:01:22,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {19398#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} ~z~0 := ~y~0; {19394#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-15 13:01:22,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {19398#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19398#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-15 13:01:22,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {19405#(and (or (<= (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 4294967291) main_~y~0 main_~x~0) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296))) (or (<= (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 4294967291) main_~y~0 main_~x~0) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 6) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296)) (< (div (+ (* (- 1) main_~x~0) (- 6) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) (div (+ 5 main_~y~0 main_~x~0 (* (- 2) main_~n~0)) 4294967296) 2))))} [140] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_33 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_66)) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (= |v_main_#t~post5_Out_60| 0) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33) (= |v_main_#t~post6_Out_60| 0)) (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19398#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-15 13:01:22,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {19170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19405#(and (or (<= (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 4294967291) main_~y~0 main_~x~0) 4294967296))) (<= (+ (div (* main_~n~0 2) 4294967296) (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296))) (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296))) (or (<= (div (+ (- 4294967292) (* (- 1) main_~x~0) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 4294967291) main_~y~0 main_~x~0) 4294967296))) (<= (div (+ (* (- 1) main_~x~0) (- 6) (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 4294967290 main_~y~0 main_~x~0) 4294967296)) (< (div (+ (* (- 1) main_~x~0) (- 6) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (* main_~n~0 2) 4294967296) (div (+ 5 main_~y~0 main_~x~0 (* (- 2) main_~n~0)) 4294967296) 2))))} is VALID [2022-04-15 13:01:22,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#true} call #t~ret13 := main(); {19170#true} is VALID [2022-04-15 13:01:22,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#true} {19170#true} #72#return; {19170#true} is VALID [2022-04-15 13:01:22,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#true} assume true; {19170#true} is VALID [2022-04-15 13:01:22,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {19170#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(10, 2);call #Ultimate.allocInit(12, 3); {19170#true} is VALID [2022-04-15 13:01:22,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {19170#true} call ULTIMATE.init(); {19170#true} is VALID [2022-04-15 13:01:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:22,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493994488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:22,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:22,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 25] total 68 [2022-04-15 13:01:33,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052844003] [2022-04-15 13:01:33,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052844003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:33,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:33,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 13:01:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628623182] [2022-04-15 13:01:33,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-15 13:01:33,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:33,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:34,172 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-15 13:01:34,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 13:01:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 13:01:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=4690, Unknown=4, NotChecked=0, Total=5402 [2022-04-15 13:01:34,173 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:14,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:02:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:28,473 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2022-04-15 13:02:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 13:02:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-15 13:02:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2022-04-15 13:02:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2022-04-15 13:02:28,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 60 transitions. [2022-04-15 13:02:29,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:29,982 INFO L225 Difference]: With dead ends: 142 [2022-04-15 13:02:29,982 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 13:02:29,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 69.1s TimeCoverageRelationStatistics Valid=1120, Invalid=9174, Unknown=8, NotChecked=0, Total=10302 [2022-04-15 13:02:29,983 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:29,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-04-15 13:02:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 13:02:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2022-04-15 13:02:30,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:30,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:30,757 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:30,757 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:30,758 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2022-04-15 13:02:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-04-15 13:02:30,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:30,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:30,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 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 131 states. [2022-04-15 13:02:30,760 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 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 131 states. [2022-04-15 13:02:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:30,761 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2022-04-15 13:02:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-04-15 13:02:30,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:30,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:30,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:30,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 117 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-04-15 13:02:30,762 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 35 [2022-04-15 13:02:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:30,763 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-04-15 13:02:30,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:30,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 145 transitions. [2022-04-15 13:02:48,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 141 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-15 13:02:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:02:48,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:48,529 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:48,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 13:02:48,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:48,730 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1008384056, now seen corresponding path program 25 times [2022-04-15 13:02:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:48,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205391375] [2022-04-15 13:02:48,880 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:02:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash 492192226, now seen corresponding path program 1 times [2022-04-15 13:02:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:48,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196550087] [2022-04-15 13:02:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:50,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {20301#(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(10, 2);call #Ultimate.allocInit(12, 3); {20278#true} is VALID [2022-04-15 13:02:50,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {20278#true} assume true; {20278#true} is VALID [2022-04-15 13:02:50,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20278#true} {20278#true} #72#return; {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {20278#true} call ULTIMATE.init(); {20301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {20301#(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(10, 2);call #Ultimate.allocInit(12, 3); {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {20278#true} assume true; {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20278#true} {20278#true} #72#return; {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {20278#true} call #t~ret13 := main(); {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {20278#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {20278#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_31)) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20278#true} is VALID [2022-04-15 13:02:50,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {20278#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20278#true} is VALID [2022-04-15 13:02:50,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {20278#true} ~z~0 := ~y~0; {20283#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:02:50,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {20283#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20284#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:02:50,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {20284#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20285#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:50,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {20285#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20286#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:50,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {20286#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20287#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:50,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {20287#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20288#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:50,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {20288#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20289#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:50,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {20289#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20290#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:50,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {20290#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20291#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:02:50,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {20291#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:50,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:50,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:50,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:02:50,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:02:50,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:02:50,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:02:50,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:02:50,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:02:50,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:02:50,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:50,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {20279#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {20279#false} is VALID [2022-04-15 13:02:50,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {20279#false} assume !(~x~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:50,796 INFO L272 TraceCheckUtils]: 30: Hoare triple {20279#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20279#false} is VALID [2022-04-15 13:02:50,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {20279#false} ~cond := #in~cond; {20279#false} is VALID [2022-04-15 13:02:50,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {20279#false} assume 0 == ~cond; {20279#false} is VALID [2022-04-15 13:02:50,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {20279#false} assume !false; {20279#false} is VALID [2022-04-15 13:02:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:02:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196550087] [2022-04-15 13:02:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196550087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059207861] [2022-04-15 13:02:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:50,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:50,797 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:50,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 13:02:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:50,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 13:02:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:50,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:52,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {20278#true} call ULTIMATE.init(); {20278#true} is VALID [2022-04-15 13:02:52,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {20278#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(10, 2);call #Ultimate.allocInit(12, 3); {20278#true} is VALID [2022-04-15 13:02:52,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {20278#true} assume true; {20278#true} is VALID [2022-04-15 13:02:52,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20278#true} {20278#true} #72#return; {20278#true} is VALID [2022-04-15 13:02:52,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {20278#true} call #t~ret13 := main(); {20278#true} is VALID [2022-04-15 13:02:52,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {20278#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20278#true} is VALID [2022-04-15 13:02:52,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {20278#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_31)) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20278#true} is VALID [2022-04-15 13:02:52,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {20278#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20278#true} is VALID [2022-04-15 13:02:52,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {20278#true} ~z~0 := ~y~0; {20283#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:02:52,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {20283#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20284#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:02:52,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {20284#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20285#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:52,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {20285#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20286#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:52,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {20286#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20287#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:52,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {20287#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20288#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:52,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {20288#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20289#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:52,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {20289#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20290#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:52,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {20290#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20291#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:02:52,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {20291#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20356#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:02:52,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {20356#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {20356#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:02:52,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {20356#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:52,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:02:52,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:02:52,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:02:52,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:02:52,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:02:52,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:02:52,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {20279#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {20279#false} assume !(~x~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L272 TraceCheckUtils]: 30: Hoare triple {20279#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {20279#false} ~cond := #in~cond; {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {20279#false} assume 0 == ~cond; {20279#false} is VALID [2022-04-15 13:02:52,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {20279#false} assume !false; {20279#false} is VALID [2022-04-15 13:02:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:02:52,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:55,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {20279#false} assume !false; {20279#false} is VALID [2022-04-15 13:02:55,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {20279#false} assume 0 == ~cond; {20279#false} is VALID [2022-04-15 13:02:55,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {20279#false} ~cond := #in~cond; {20279#false} is VALID [2022-04-15 13:02:55,060 INFO L272 TraceCheckUtils]: 30: Hoare triple {20279#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {20279#false} is VALID [2022-04-15 13:02:55,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {20279#false} assume !(~x~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:55,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {20279#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {20279#false} is VALID [2022-04-15 13:02:55,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {20279#false} is VALID [2022-04-15 13:02:55,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20300#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:02:55,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20299#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:02:55,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20298#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:02:55,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20297#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:02:55,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20296#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:02:55,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20295#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:02:55,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20294#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:02:55,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20293#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:55,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:55,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {20453#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20292#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:55,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {20457#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20453#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 13:02:55,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {20461#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20457#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 13:02:55,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {20465#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20461#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 13:02:55,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {20469#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20465#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 13:02:55,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {20473#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20469#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 13:02:55,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {20477#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20473#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 13:02:55,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {20481#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967289) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20477#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 13:02:55,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {20485#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20481#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 13:02:55,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {20278#true} ~z~0 := ~y~0; {20485#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (<= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-15 13:02:55,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {20278#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20278#true} is VALID [2022-04-15 13:02:55,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {20278#true} [142] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_34 v_main_~x~0_Out_68)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_68) (+ v_main_~x~0_In_34 v_main_~y~0_In_31)) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20278#true} is VALID [2022-04-15 13:02:55,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {20278#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20278#true} is VALID [2022-04-15 13:02:55,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {20278#true} call #t~ret13 := main(); {20278#true} is VALID [2022-04-15 13:02:55,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20278#true} {20278#true} #72#return; {20278#true} is VALID [2022-04-15 13:02:55,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {20278#true} assume true; {20278#true} is VALID [2022-04-15 13:02:55,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {20278#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(10, 2);call #Ultimate.allocInit(12, 3); {20278#true} is VALID [2022-04-15 13:02:55,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {20278#true} call ULTIMATE.init(); {20278#true} is VALID [2022-04-15 13:02:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 13:02:55,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059207861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:55,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:55,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2022-04-15 13:02:57,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:57,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205391375] [2022-04-15 13:02:57,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205391375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:57,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:57,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:02:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883534291] [2022-04-15 13:02:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 13:02:57,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:57,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:58,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:58,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:02:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:58,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:02:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:02:58,002 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)